Sciweavers

3341 search results - page 511 / 669
» On Bounded Queries and Approximation
Sort
View
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 7 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
AIEDAM
2008
127views more  AIEDAM 2008»
15 years 6 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
CC
2008
Springer
131views System Software» more  CC 2008»
15 years 6 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
CVGIP
2010
182views more  CVGIP 2010»
15 years 5 months ago
MCCD: Multi-core collision detection between deformable models using front-based decomposition
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to ...
Min Tang, Dinesh Manocha, Ruofeng Tong
JAR
2007
142views more  JAR 2007»
15 years 5 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler