Sciweavers

9209 search results - page 46 / 1842
» Data Space Randomization
Sort
View
ICIP
2007
IEEE
14 years 4 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
ENGL
2007
91views more  ENGL 2007»
13 years 9 months ago
RRT-based strategies for sensor-based exploration
—Real mobile robots should be able to build an abstract representation of the physical environment, in order to navigate and to work in such environment. We present a method for ...
Abraham Sánchez López, Judith Le&oac...
FOCS
2006
IEEE
14 years 3 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
ICTAI
1999
IEEE
14 years 2 months ago
On the Fine Structure of Large Search Spaces
Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, o...
Carla P. Gomes, Bart Selman
JSAC
2007
97views more  JSAC 2007»
13 years 9 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li