Sciweavers

5144 search results - page 193 / 1029
» Enhancing Search with Structure
Sort
View
154
Voted
SIBGRAPI
2008
IEEE
15 years 11 months ago
Tradeoffs in Approximate Range Searching Made Simpler
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
PPOPP
2012
ACM
14 years 6 days ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
IPPS
2003
IEEE
15 years 10 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
180
Voted
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
15 years 8 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
170
Voted
CORR
2006
Springer
159views Education» more  CORR 2006»
15 years 4 months ago
Structural Alignments of pseudo-knotted RNA-molecules in polynomial time
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...
Michael Brinkmeier