Sciweavers

733 search results - page 121 / 147
» Recommending random walks
Sort
View
GRC
2010
IEEE
14 years 10 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...
72
Voted
CORR
2010
Springer
119views Education» more  CORR 2010»
14 years 9 months ago
Graph-Constrained Group Testing
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Ve...
CORR
2008
Springer
123views Education» more  CORR 2008»
14 years 9 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
CORR
2008
Springer
88views Education» more  CORR 2008»
14 years 9 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
ECCC
2006
77views more  ECCC 2006»
14 years 9 months ago
Extractors and condensers from univariate polynomials
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
Venkatesan Guruswami, Christopher Umans, Salil P. ...