Sciweavers

396 search results - page 18 / 80
» Beyond the metric space model
Sort
View
ENTCS
2006
136views more  ENTCS 2006»
13 years 7 months ago
Adaptive Application of SAT Solving Techniques
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Ohad Shacham, Karen Yorav
ICALP
2004
Springer
14 years 1 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
EUROMED
2010
13 years 5 months ago
Communication of Digital Cultural Heritage in Public Spaces by the Example of Roman Cologne
Abstract. The communication of cultural heritage in public spaces such as museums or exhibitions, gain more and more importance during the last years. The possibilities of interact...
Matthias Trapp, Amir Semmo, Rafael Pokorski, Claus...
RSP
2006
IEEE
120views Control Systems» more  RSP 2006»
14 years 1 months ago
A Case Study of Design Space Exploration for Embedded Multimedia Applications on SoCs
Embedded real-time multimedia applications usually imply data parallel processing. SIMD processors embedded in SOCs are cost-effective to exploit the underlying parallelism. Howev...
Isabelle Hurbain, Corinne Ancourt, François...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 9 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