Sciweavers

379 search results - page 1 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
MST
2006
90views more  MST 2006»
13 years 4 months ago
The Graham-Knowlton Problem Revisited
In late
Navin Goyal, Sachin Lodha, S. Muthukrishnan
STOC
2006
ACM
117views Algorithms» more  STOC 2006»
13 years 10 months ago
Pseudorandom walks on regular digraphs and the RL vs. L problem
We revisit the general RL vs. L question, obtaining the following results.
Omer Reingold, Luca Trevisan, Salil P. Vadhan
CHI
2007
ACM
14 years 5 months ago
Web page revisitation revisited: implications of a long-term click-stream study of browser usage
This paper presents results of an extensive long-term clickstream study of Web browser usage. Focusing on character and challenges of page revisitation, previous findings from sev...
Hartmut Obendorf, Harald Weinreich, Eelco Herder, ...
EVOW
2009
Springer
13 years 2 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
ICALP
2009
Springer
14 years 5 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty