921 search results - page 56 / 185 » New Data Structures for Orthogonal Range Searching |
151
click to vote
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
129
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Evolutionary algorithms are among the metaheuristic search methods that have been applied to the structural test data generation problem. Fitness evaluation methods play an import...
155
Voted
BMCBI
2007
15 years 4 months ago
2007
Background: High-throughput peptide and protein identification technologies have benefited tremendously from strategies based on tandem mass spectrometry (MS/MS) in combination wi...
139
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
188
click to vote
BMCBI
2011
14 years 7 months ago
2011
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...