217 search results - page 11 / 44 » On the Fine Structure of Large Search Spaces |
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
ICDAR
2003
IEEE
14 years 22 days ago
2003
IEEE
Interpretation of paper drawings has received a good deal of attention over the last decade. Progress has also been made in related areas such as direct interpretation of human dr...
MINAR
1998
Springer
13 years 11 months ago
1998
Springer
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...
ALENEX
2001
13 years 8 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
VMV
2001
13 years 8 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...