Sciweavers

3020 search results - page 120 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
FOCS
2008
IEEE
16 years 29 days ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
BMCBI
2010
122views more  BMCBI 2010»
15 years 6 months ago
Fast and accurate protein substructure searching with simulated annealing and GPUs
Background: Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioin...
Alex Stivala, Peter J. Stuckey, Anthony Wirth
ADC
2005
Springer
97views Database» more  ADC 2005»
16 years 1 days ago
Querying and Maintaining Ordered XML Data using Relational Databases
Although data stored in XML is of increasing importance, most existing data repositories are still managed by relational database systems. In light of this, recent XML database re...
William M. Shui, Franky Lam, Damien K. Fisher, Ray...
CIKM
2006
Springer
15 years 8 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
15 years 4 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola