4850 search results - page 700 / 970 » Approximate Data Structures with Applications |
135
click to vote
VLDB
1999
ACM
15 years 9 months ago
1999
ACM
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
181
click to vote
ISMIS
1997
Springer
15 years 9 months ago
1997
Springer
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
140
click to vote
AOSD
2007
ACM
15 years 9 months ago
2007
ACM
Embedded systems are an important field of research and will gain momentum in the near future. Many of these systems require data management functionality. Due to the resource con...
142
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
137
Voted
CIKM
2008
Springer
15 years 7 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...