Sciweavers

237 search results - page 11 / 48
» Methods for Achieving Fast Query Times in Point Location Dat...
Sort
View
EDBT
2006
ACM
190views Database» more  EDBT 2006»
14 years 8 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...
BMCBI
2010
122views more  BMCBI 2010»
13 years 8 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
COMPGEOM
2010
ACM
14 years 28 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 9 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
ICIAR
2009
Springer
14 years 2 months ago
Video Compression and Retrieval of Moving Object Location Applied to Surveillance
Abstract. A major problem in surveillance systems is the storage requirements for video archival; videos are recorded continuously for long periods of time, resulting in large amou...
William Robson Schwartz, Hélio Pedrini, Lar...