1763 search results - page 336 / 353 » Dependent random choice |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
MM
2006
ACM
14 years 1 months ago
2006
ACM
Labeling objects in images is an essential prerequisite for many visual learning and recognition applications that depend on training data, such as image retrieval, object detecti...
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of large-scale retrieval evaluation, and we propose a statistical method for evaluating retrieval systems using incomplete judgments. Unlike existing techn...
SIGMETRICS
2006
ACM
14 years 1 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— While earlier studies have pointed out that short-lived TCP flows (mice) may hurt long-lived TCP flows (elephants) in the long term, they provide insufficient insight for devel...