1431 search results - page 133 / 287 » The complexity of random ordered structures |
149
click to vote
P2P
2010
IEEE
15 years 1 months ago
2010
IEEE
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
101
click to vote
LRE
2002
15 years 2 months ago
2002
Users need more sophisticated tools to handle the growing number of image-based documents available in databases. In this paper, we present a system devoted to the editing and bro...
154
click to vote
JMLR
2010
14 years 10 months ago
2010
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
149
click to vote
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
142
click to vote
STOC
1996
ACM
15 years 7 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...