Sciweavers

312 search results - page 25 / 63
» Indexing Gapped-Factors Using a Tree
Sort
View
SEBD
1997
158views Database» more  SEBD 1997»
13 years 11 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
TOIS
2002
97views more  TOIS 2002»
13 years 9 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
DCC
2008
IEEE
14 years 9 months ago
On Self-Indexing Images - Image Compression with Added Value
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
Veli Mäkinen, Gonzalo Navarro
ICPR
2008
IEEE
14 years 4 months ago
Retinal vessel tree segmentation using a deformable contour model
This paper presents an improved version of our specific methodology to detect the vessel tree in retinal angiographies. The automatic analysis of retinal vessel tree facilitates ...
Lucia Espona, María J. Carreira, Manuel Fra...
ACL
2003
13 years 11 months ago
An Evaluation Method of Words Tendency using Decision Tree
In every text, some words have frequency appearance and are considered as keywords because they have strong relationship with the subjects of their texts, these words frequencies ...
El-Sayed Atlam, Masaki Oono, Jun-Ichi Aoe