33 search results - page 5 / 7 » An Efficient Query Structure for Mesh Refinement |
SIGMOD
2003
ACM
14 years 6 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
SMA
2009
ACM
14 years 23 days ago
2009
ACM
The Corner Table (CT) promoted by Rossignac et al. provides a simple and efficient representation of triangle meshes, storing 6 integer references per triangle (3 vertex reference...
CVPR
2009
IEEE
15 years 1 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...
DASFAA
2006
IEEE
14 years 9 days ago
2006
IEEE
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....
MST
2006
13 years 6 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...