10608 search results - page 317 / 2122 » Complexity of O'Hara's Algorithm |
104
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
143
Voted
MOC
1998
15 years 10 days ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
108
Voted
VLDB
2002
ACM
15 years 9 days ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
106
Voted
COR
2008
15 years 8 days ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
124
click to vote
RC
2007
15 years 5 days ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...