1888 search results - page 67 / 378 » Algorithms for Querying by Spatial Structure |
115
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
128
click to vote
ICPR
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
132
click to vote
PODS
2002
ACM
16 years 4 months ago
2002
ACM
Decision support system users typically submit batches of range-sum queries simultaneously rather than issuing individual, unrelated queries. We propose a wavelet based technique ...
188
click to vote
DCG
2010
15 years 4 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
156
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
Spatial queries for extracting data from wireless sensor networks are important for many applications, such as environmental monitoring and military surveillance. One such query i...