Sciweavers

1390 search results - page 124 / 278
» Self-Sizing of Clustered Databases
Sort
View
SRDS
1998
IEEE
14 years 1 months ago
Interactive Image Retrieval over the Internet
In the paper, an e cient image database system is developed. The most important features of the proposed system include compressed domain indexing, searching by using scalable fea...
Jozsef Vass, Jia Yao, Anupam Joshi, Kannappan Pala...
VLDB
2000
ACM
166views Database» more  VLDB 2000»
14 years 26 days ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
HT
1991
ACM
14 years 25 days ago
Identifying Aggregates in Hypertext Structures
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
Rodrigo A. Botafogo, Ben Shneiderman
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
14 years 24 days ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
CG
2010
Springer
13 years 9 months ago
An evaluation of descriptors for large-scale image retrieval from sketched feature lines
We address the problem of fast, large scale sketch-based image retrieval, searching in a database of over one million images. We show that current retrieval methods do not scale w...
Mathias Eitz, Kristian Hildebrand, Tamy Boubekeur,...