2137 search results - page 364 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
113
click to vote
ISCAPDCS
2004
15 years 3 months ago
2004
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
124
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
134
Voted
SIAMJO
2000
15 years 2 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
119
click to vote
CISS
2008
IEEE
15 years 9 months ago
2008
IEEE
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
133
click to vote
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...