1951 search results - page 223 / 391 » An algorithm for improving graph partitions |
209
Voted
HLK
2003
IEEE
15 years 10 months ago
2003
IEEE
It’s common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts “filled-in” by prior visual knowledge. In this pa...
197
click to vote
SLS
2009
Springer
15 years 11 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
148
click to vote
SIGCOMM
2006
ACM
15 years 11 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
157
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
189
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...