Sciweavers

768 search results - page 59 / 154
» Efficient Correlation Search from Graph Databases
Sort
View
119
Voted
WWW
2005
ACM
16 years 4 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
140
Voted
CIVR
2008
Springer
106views Image Analysis» more  CIVR 2008»
15 years 5 months ago
Scalable Markov model-based image annotation
In this paper, we propose a novel Markov model-based formulation for the image annotation problem. In this formulation, we treat image annotation as a graph ranking problem, by de...
Changhu Wang, Lei Zhang, Hong-Jiang Zhang
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
16 years 5 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
15 years 3 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
136
Voted
ISBI
2004
IEEE
16 years 4 months ago
Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image Retrieval
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Phillip Mlsna, Nikolay Sirakov