5592 search results - page 163 / 1119 » On Random Betweenness Constraints |
133
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
136
click to vote
SIGIR
2006
ACM
15 years 11 months ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
135
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
136
click to vote
ICPP
1998
IEEE
15 years 9 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
140
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...