3360 search results - page 308 / 672 » Opportunistic Data Structures with Applications |
165
click to vote
ERLANG
2003
ACM
15 years 10 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
132
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
130
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
A novel algorithm for robustly segmenting changes between different images of a scene is presented. This computationally efficient algorithm is based on a non-linear comparison of...
115
click to vote
ICDIM
2008
IEEE
15 years 11 months ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
150
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval f...