Sciweavers

5746 search results - page 313 / 1150
» Visualizing Query Structure
Sort
View
FOCS
2007
IEEE
16 years 1 months ago
Quantum Algorithms for Hidden Nonlinear Structures
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
Andrew M. Childs, Leonard J. Schulman, Umesh V. Va...
PODC
2004
ACM
16 years 6 days ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...
ICPR
2002
IEEE
15 years 11 months ago
A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric
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...
Guangming Li, Jie Tian, Mingchang Zhao, Huiguang H...
CCCG
2010
15 years 8 months ago
Towards a dynamic data structure for efficient bounded line range search
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
Thuy Le, Bradford G. Nickerson
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 6 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...