Sciweavers

1385 search results - page 151 / 277
» Clustering by Random Projections
Sort
View
ICALP
1992
Springer
15 years 10 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
NIPS
2007
15 years 7 months ago
Cooled and Relaxed Survey Propagation for MRFs
We describe a new algorithm, Relaxed Survey Propagation (RSP), for finding MAP configurations in Markov random fields. We compare its performance with state-of-the-art algorith...
Hai Leong Chieu, Wee Sun Lee, Yee Whye Teh
ICDM
2003
IEEE
184views Data Mining» more  ICDM 2003»
15 years 11 months ago
Analyzing High-Dimensional Data by Subspace Validity
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method l...
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, D...
ICPR
2010
IEEE
15 years 4 months ago
NAVIDOMASS: Structural-based Approaches Towards Handling Historical Documents
In the context of the NAVIDOMASS project, the problematic of this paper concerns the clustering of historical document images. We propose a structural-based framework to handle the...
Salim Jouili, Mickaël Coustaty, Salvatore Tab...
NOSSDAV
2009
Springer
16 years 1 months ago
Overlay monitoring and repair in swarm-based peer-to-peer streaming
In Swarm-based Peer-to-Peer Streaming (SPS) mechanisms, participating peers form a randomly connected mesh over which they incorporate swarm-like content delivery. In practice, a ...
Nazanin Magharei, Reza Rejaie