Sciweavers

2001 search results - page 252 / 401
» Indexing in a Hypertext Database
Sort
View
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 10 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
CIKM
2009
Springer
14 years 5 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
14 years 4 months ago
Distributing Google
We consider the problem of wide-area large-scale text search over a peer-to-peer infrastructure. A wide-area search infrastructure with billions of documents and millions of searc...
Vijay Gopalakrishnan, Bobby Bhattacharjee, Peter J...
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
14 years 2 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
TIP
2010
138views more  TIP 2010»
13 years 8 months ago
Motion Tuned Spatio-Temporal Quality Assessment of Natural Videos
—There has recently been a great deal of interest in the development of algorithms that objectively measure the integrity of video signals. Since video signals are being delivere...
Kalpana Seshadrinathan, Alan C. Bovik