Search results for "Running time"
showing 10 items of 20 documents
Lackadaisical Quantum Walks with Multiple Marked Vertices
2019
The concept of lackadaisical quantum walk – quantum walk with self loops – was first introduced for discrete-time quantum walk on one-dimensional line [8]. Later it was successfully applied to improve the running time of the spacial search on two-dimensional grid [16].
Quantum walks on two-dimensional grids with multiple marked locations
2015
The running time of a quantum walk search algorithm depends on both the structure of the search space (graph) and the configuration (the placement and the number) of marked locations. While the first dependence has been studied in a number of papers, the second dependence remains mostly unstudied.We study search by quantum walks on the two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [3]. The original paper analyses one and two marked locations only. We move beyond two marked locations and study the behaviour of the algorithm for several configurations of multiple marked locations.In this paper, we prove two results showing the importance of how the marked locations ar…
Extending the sGLOH descriptor
2015
This paper proposes an extension of the sGLOH keypoint descriptor [3] which improves its robustness and discriminability. The sGLOH descriptor can handle discrete rotations by a cyclic shift of its elements thanks to its circular structure, but its performance can decrease when the keypoint relative rotation is in between two sGLOH discrete rotations. The proposed extension couples together two sGLOH descriptors for the same patch with different rotations in order to cope with this issue and it can be also applied straightly to the sCOr and sGOr matching strategies of sGLOH. Experimental results show a consistent improvement of the descriptor discriminability, while different setups can be …
Analysis of Hawaii ironman performances in elite triathletes from 1981 to 2007.
2008
International audience; PURPOSE: To examine the improvement in swimming (3.8 km), cycling (180 km), running (42.2 km), and overall performances at the Hawaii Ironman Triathlon of elite males and females between 1981 and 2007. METHODS: Trends across years, gender differences in performance times in the three disciplines, and overall winning times of the top 10 males and females were analyzed. RESULTS: Overall performance time in the ironman decreased rapidly from 1981 but has remained stable since the late 1980s. From 1988 to 2007, linear regression analysis showed that change in swimming, cycling, running, and total performance for both males and females was less than 1.4% per decade, excep…
A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning
2003
We propose a new method for finding the minimum ratio-cut of a graph. Ratio-cut is NP-hard problem for which the best previously known algorithm gives an O(log n)-factor approximation by solving its dually related maximum concurrent flow problem.We formulate the minimum ratio-cut as a certain nondifferentiable optimization problem, and show that the global minimum of the optimization problem is equal to the minimum ratio-cut. Moreover, we provide strong symbolic computation based evidence that any strict local minimum gives an approximation by a factor of 2. We also give an efficient heuristic algorithm for finding a local minimum of the proposed optimization problem based on standard nondi…
Gain fractions of future neutrino oscillation facilities over T2K and NOvA
2013
We evaluate the probability of future neutrino oscillation facilities to discover leptonic CP violation and/or measure the neutrino mass hierarchy. We study how this probability is affected by positive or negative hints for these observables to be found at T2K and NO nu A. We consider the following facilities: LBNE; T2HK; and the 10 GeV Neutrino Factory (NF10), and show how their discovery probabilities change with the running time of T2K and NO nu A conditioned to their results. We find that, if after 15 years T2K and NO nu A have not observed a 90% CL hint of CP violation, then LBNE and T2HK have less than a 10% chance of achieving a 5 sigma discovery, whereas NF10 still has a similar to …
Grover’s Search with Faults on Some Marked Elements
2016
Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size N using $$O\sqrt{N}$$ queries. It provides a significant speed-up over any classical algorithm [2]. The running time of the algorithm, however, is very sensitive to errors in queries. Multiple authors have analysed the algorithm using different models of query errors and showed the loss of quantum speed-up [1, 4]. We study the behavior of Grover's algorithm in the model where the search space contains both faulty and non-faulty marked elements. We show that in this setting it is indeed possible to find one of marked elements in $$O\sqrt{N}$$ queries.
Organization of Production Processes through the Multi-Service Method by Performing some Identical Operations of the same Duration and Structure
2013
Organisation of production processes, by means of multi service method refers to the performance of attributions within a working system, using simultaneously or successively more inputs or more items in a single means of production, by one or more employees. In the specifically chosen case, in order to outline the advantages that shall be obtained after implementing the multi service method, we want to illustrate a situation where there are the execution conditions of certain identical operations, with the same duration and structure, in which case the running time of the performer and the means of production will be identical. Serving multiple machines finds application in all industrial …
The Car Resequencing Problem with Pull-Off Tables
2011
AbstractThe car sequencing problem determines sequences of different car models launched down a mixed- model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.
A comparison between two feature selection algorithms
2017
This article provides a comparison of two feature selection algorithms, Information Gain Thresholding and Koller and Sahami's algorithm in the context of text document classification on the Reuters Corpus Volume 1 dataset. The algorithms were evaluated by testing the performance of classifiers trained on the features they select from a given dataset. Results show that Koller and Sahami's algorithm consistently outperforms Information Gain Thresholding by capturing interactions between features and avoiding redundancy among features, although it achieves its gains through increased complexity and longer running time.