Sciweavers

1385 search results - page 64 / 277
» Clustering by Random Projections
Sort
View
GLOBECOM
2008
IEEE
15 years 6 months ago
Impact of Random Mobility on the Inhomogeneity of Spatial Distributions
Abstract—Simulation results of wireless networks heavily depend on the spatial distribution of its nodes. Even though the initial distribution may match the expectations of the r...
Michael Gyarmati, Udo Schilcher, Günther Bran...
AIIA
2009
Springer
15 years 6 months ago
Partitioning Search Spaces of a Randomized Search
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
NIPS
2008
15 years 1 months ago
Sparse Signal Recovery Using Markov Random Fields
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the th...
Volkan Cevher, Marco F. Duarte, Chinmay Hegde, Ric...
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 12 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
CVPR
2012
IEEE
13 years 2 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee