Sciweavers

767 search results - page 111 / 154
» On Clustering Using Random Walks
Sort
View
FOCS
2000
IEEE
13 years 11 months ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 9 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 7 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»
13 years 7 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. ...
TON
2008
149views more  TON 2008»
13 years 7 months ago
Building heterogeneous peer-to-peer networks: protocol and analysis
In this paper, we propose a simple protocol for building heterogeneous unstructured peer-to-peer (P2P) networks. The protocol consists of two parts--the joining process and the reb...
Kin Wah Kwong, Danny H. K. Tsang