4403 search results - page 157 / 881 » Galois Theory of Algorithms |
211
Voted
WEA
2010
Springer
16 years 1 months ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
163
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...
173
click to vote
CADE
1999
Springer
15 years 11 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
159
click to vote
JDA
2008
15 years 7 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
143
click to vote
ACCV
2009
Springer
16 years 1 months ago
2009
Springer
What are the primitives of visual perception? The early feature-analysis theory insists on it being a local-to-global process which has acted as the foundation of most computer vis...