Sciweavers

156 search results - page 16 / 32
» A Content-Addressable Network for Similarity Search in Metri...
Sort
View
ECML
2006
Springer
13 years 11 months ago
Subspace Metric Ensembles for Semi-supervised Clustering of High Dimensional Data
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
Bojun Yan, Carlotta Domeniconi
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
13 years 9 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...
FOCS
2009
IEEE
13 years 11 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
UAI
1996
13 years 9 months ago
Critical Remarks on Single Link Search in Learning Belief Networks
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which ...
Yang Xiang, S. K. Michael Wong, Nick Cercone
ICIP
2003
IEEE
14 years 9 months ago
Generalized pattern matching using orbit decomposition
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
Yacov Hel-Or, Hagit Hel-Or