Sciweavers

824 search results - page 126 / 165
» Weighted Low-Rank Approximations
Sort
View
ICCV
2001
IEEE
16 years 1 months ago
3D Object Tracking Using Shape-Encoded Particle Propagation
We present a comprehensive treatment of 3D object tracking by posing it as a nonlinear state estimation problem. The measurements are derived using the outputs of shape-encoded fi...
Hankyu Moon, Rama Chellappa, Azriel Rosenfeld
ECCV
2002
Springer
16 years 1 months ago
Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
Sébastien Granger, Xavier Pennec
INFOCOM
2000
IEEE
15 years 4 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 3 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 1 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta