1952 search results - page 359 / 391 » Complete partitions of graphs |
157
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
157
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We present a novel approach for robust localization of multiple people observed using multiple cameras. We use this location information to generate sports visualizations, which i...
151
click to vote
CCCG
2009
15 years 5 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
133
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
134
click to vote
EJC
2006
15 years 4 months ago
2006
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...