Sciweavers

2166 search results - page 387 / 434
» Continuous query processing in data streams using duality of...
Sort
View
COMPGEOM
2006
ACM
14 years 2 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
DBA
2006
236views Database» more  DBA 2006»
13 years 10 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
CHI
2011
ACM
13 years 8 days ago
No clicks, no problem: using cursor movements to understand and improve search
Understanding how people interact with search engines is important in improving search quality. Web search engines typically analyze queries and clicked results, but these actions...
Jeff Huang, Ryen W. White, Susan T. Dumais
BMCBI
2008
130views more  BMCBI 2008»
13 years 8 months ago
A database of phylogenetically atypical genes in archaeal and bacterial genomes, identified using the DarkHorse algorithm
Background: The process of horizontal gene transfer (HGT) is believed to be widespread in Bacteria and Archaea, but little comparative data is available addressing its occurrence ...
Sheila Podell, Terry Gaasterland, Eric E. Allen
PAMI
2006
132views more  PAMI 2006»
13 years 8 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...