484 search results - page 76 / 97 » Measuring the Quality of Approximated Clusterings |
129
click to vote
JAIR
2002
15 years 1 months ago
2002
We propose a structured approach to the problem of retrieval of images by content and present a description logic that has been devised for the semantic indexing and retrieval of ...
109
click to vote
PVLDB
2010
15 years 9 days ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
247
click to vote
SISAP
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
126
click to vote
MIA
2010
14 years 8 months ago
2010
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
104
click to vote
WSDM
2009
ACM
15 years 8 months ago
2009
ACM
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...