613 search results - page 83 / 123 » Query Evaluation on a Database Given by a Random Graph |
86
Voted
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
121
click to vote
DEXAW
2006
IEEE
15 years 6 months ago
2006
IEEE
The effective grouping, or partitioning, of semistructured data is of fundamental importance when providing support for queries. Partitions allow items within the data set that sh...
ADC
2004
Springer
15 years 5 months ago
2004
Springer
Document retrieval and web search engines index large quantities of text. The static costs associated with storing the index can be traded against dynamic costs associated with us...
194
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
To preserve client privacy in the data mining process, a variety of techniques based on random perturbation of individual data records have been proposed recently. In this paper, ...
ICRA
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...