273 search results - page 27 / 55 » Can Pure Cutting Plane Algorithms Work |
115
Voted
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
167
click to vote
MMSEC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we introduce to the special domain of image annotation watermarking, based on embedding of hierarchical data related to objects into user-selected areas on an image...
143
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
128
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We present a practical framework for detecting and modeling 3D static occlusions for wide-baseline, multi-camera scenarios where the number of cameras is small. The framework cons...
140
click to vote
TOG
2008
15 years 3 months ago
2008
Fascinating and elegant shapes may be folded from a single planar sheet of material without stretching, tearing or cutting, if one incorporates curved folds into the design. We pr...