Sciweavers

88 search results - page 10 / 18
» Approximate Range Searching Using Binary Space Partitions
Sort
View
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 8 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 8 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
CP
2004
Springer
14 years 2 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes
SCIA
2005
Springer
110views Image Analysis» more  SCIA 2005»
14 years 2 months ago
Training Cellular Automata for Image Processing
Experiments were carried out to investigate the possibility of training cellular automata to to perform processing. Currently, only binary images are considered, but the space of r...
Paul L. Rosin
JAIR
2011
123views more  JAIR 2011»
13 years 3 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...