Sciweavers

273 search results - page 43 / 55
» Can Pure Cutting Plane Algorithms Work
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
GIS
2007
ACM
14 years 8 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar

Publication
267views
14 years 3 months ago
Interactive planar reconstruction of objects and scenes
3D reconstruction from 2D images is an active research topic in the computer vision community. Classical algorithms like Structure From Motion (SFM) and Multi-View Stereo (MVS) are...
Adarsh Kowdle, Yao-Jen Chang, Tsuhan Chen
PODC
2011
ACM
12 years 10 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
IVC
2007
187views more  IVC 2007»
13 years 7 months ago
Non-rigid structure from motion using ranklet-based tracking and non-linear optimization
In this paper, we address the problem of estimating the 3D structure and motion of a deformable object given a set of image features tracked automatically throughout a video seque...
Alessio Del Bue, Fabrizio Smeraldi, Lourdes de Aga...