Sciweavers

1038 search results - page 77 / 208
» Space-Bounded Query Approximation
Sort
View
153
Voted
JGTOOLS
2006
199views more  JGTOOLS 2006»
15 years 2 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman
258
Voted
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 4 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
124
Voted
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
16 years 2 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
236
Voted
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
16 years 4 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
16 years 3 months ago
Querying Imprecise Data in Moving Object Environments
In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of a...
Reynold Cheng, Sunil Prabhakar, Dmitri V. Kalashni...