Sciweavers

767 search results - page 15 / 154
» On Clustering Using Random Walks
Sort
View
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
14 years 20 days ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
COMPLEX
2009
Springer
14 years 3 months ago
Composing Music with Complex Networks
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
Xiaofan Liu, Chi Kong Tse, Michael Small
ICASSP
2010
IEEE
13 years 8 months ago
Bridge detection and robust geodesics estimation via random walks
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
Eugene Brevdo, Peter J. Ramadge
GRC
2010
IEEE
13 years 8 months ago
Geo-clustering of Images with Missing GeoTags
—Images with GPS coordinates are a rich source of information about a geographic location. Innovative user services and applications are being built using geotagged images taken ...
Vishwakarma Singh, Sharath Venkatesha, Ambuj K. Si...
ICML
2007
IEEE
14 years 9 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran