1041 search results - page 7 / 209 » Randomizing Reductions of Search Problems |
EMNLP
2007
13 years 9 months ago
2007
Traditional research on spelling correction in natural language processing and information retrieval literature mostly relies on pre-defined lexicons to detect spelling errors. Bu...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We present an algorithm to reduce per-pixel search ranges for Markov Random Fields-based stereo algorithms. Our algorithm is based on the intuitions that reliably matched pixels ne...
ISAAC
2003
Springer
14 years 25 days ago
2003
Springer
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
AIIA
2009
Springer
14 years 2 months ago
2009
Springer
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...