Sciweavers

166 search results - page 28 / 34
» Tighter Bounds for Structured Estimation
Sort
View
PODC
2009
ACM
14 years 10 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
14 years 3 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
SI3D
2009
ACM
14 years 4 months ago
Soft irregular shadow mapping: fast, high-quality, and robust soft shadows
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
Gregory S. Johnson, Warren A. Hunt, Allen Hux, Wil...
CVPR
2004
IEEE
14 years 12 months ago
On the Distribution of Saliency
The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms typically mark edge-points with some s...
Alexander Berengolts, Michael Lindenbaum
ICCV
2007
IEEE
14 years 11 months ago
Globally Optimal Affine and Metric Upgrades in Stratified Autocalibration
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
Manmohan Krishna Chandraker, Sameer Agarwal, David...