244 search results - page 27 / 49 » On-Line Probability, Complexity and Randomness |
STOC
1996
ACM
14 years 1 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
DIALM
2008
ACM
13 years 10 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
SIGIR
2006
ACM
14 years 2 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
HICSS
2007
IEEE
14 years 3 months ago
2007
IEEE
The effective management of a supply chain requires performance measures that accurately represent the underlying structure of the supply chain. Measures such as delivery performa...