2001 search results - page 32 / 401 » Indexing in a Hypertext Database |
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
BIBE
2003
IEEE
14 years 2 months ago
2003
IEEE
Hierarchical metric-space clustering methods have been commonly used to organize proteomes into taxonomies. Consequently, it is often anticipated that hierarchical clustering can ...
VLDB
1999
ACM
14 years 1 months ago
1999
ACM
In a temporal OODB, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal OODB, the OIDX should also index the objec...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...