921 search results - page 125 / 185 » New Data Structures for Orthogonal Range Searching |
134
Voted
BMCBI
2010
15 years 4 months ago
2010
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
115
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. This article introduces KWQL, spoken “quickel”, a rulebased query language for a semantic wiki based on the label-keyword query paradigm. KWQL allows for rich combine...
270
click to vote
VLDB
2002
ACM
16 years 4 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
143
click to vote
SSD
2001
Springer
15 years 8 months ago
2001
Springer
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
133
Voted
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...