Sciweavers

18 search results - page 2 / 4
» On computing enclosing isosceles triangles and related probl...
Sort
View
CVPR
2010
IEEE
14 years 2 months ago
Non-Rigid Structure from Locally-Rigid Motion
We introduce locally-rigid motion, a general framework for solving the M-point, N-view structure-from-motion problem for unknown bodies deforming under orthography. The key idea i...
Jonathan Taylor, Allan Jepson, Kyros Kutulakos
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 7 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
NSDI
2007
13 years 8 months ago
Network Coordinates in the Wild
Network coordinates provide a mechanism for selecting and placing servers efficiently in a large distributed system. This approach works well as long as the coordinates continue ...
Jonathan Ledlie, Paul Gardner, Margo I. Seltzer
AAAI
2010
13 years 7 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
PSIVT
2007
Springer
239views Multimedia» more  PSIVT 2007»
14 years 16 days ago
People Counting in Low Density Video Sequences
This paper presents a novel approach for automatic people counting in videos captured through a conventional closed-circuit television (CCTV) using computer vision techniques. The ...
Jaime Dalla Valle, Luiz E. Soares de Oliveira, Ale...