Sciweavers

921 search results - page 38 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
132
Voted
FOCS
2008
IEEE
15 years 10 months 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
2007
124views more  BMCBI 2007»
15 years 3 months ago
Protein structural similarity search by Ramachandran codes
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...
Wei-Cheng Lo, Po-Jung Huang, Chih-Hung Chang, Ping...
ACSC
2004
IEEE
15 years 7 months ago
Access-Ordered Indexes
Search engines are an essential tool for modern life. We use them to discover new information on diverse topics and to locate a wide range of resources. The search process in all ...
Steven Garcia, Hugh E. Williams, Adam Cannane
152
Voted
DAWAK
2006
Springer
15 years 7 months ago
Mixed Decision Trees: An Evolutionary Approach
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
Marek Kretowski, Marek Grzes
CSB
2003
IEEE
176views Bioinformatics» more  CSB 2003»
15 years 9 months ago
3D Structural Homology Detection via Unassigned Residual Dipolar Couplings
Recognition of a protein’s fold provides valuable information about its function. While many sequence-based homology prediction methods exist, an important challenge remains: tw...
Christopher James Langmead, Bruce Randall Donald