Sciweavers

3055 search results - page 77 / 611
» Randomized Search Trees
Sort
View
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
13 years 11 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
AINA
2009
IEEE
14 years 5 months ago
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Ya...
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
14 years 3 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
GIS
2010
ACM
13 years 8 months ago
Location disambiguation in local searches using gradient boosted decision trees
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...
Ritesh Agrawal, James G. Shanahan
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
12 years 20 days ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray