Sciweavers

9166 search results - page 1504 / 1834
» A framework for comparing models of computation
Sort
View
FOCS
2005
IEEE
16 years 10 days ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
GRAPHITE
2007
ACM
15 years 10 months ago
Compact and efficient generation of radiance transfer for dynamically articulated characters
We present a data-driven technique for generating the precomputed radiance transfer vectors of an animated character as a function of its joint angles. We learn a linear model for...
Derek Nowrouzezahrai, Patricio D. Simari, Evangelo...
CVIU
2004
115views more  CVIU 2004»
15 years 6 months ago
Context-dependent segmentation and matching in image databases
The content of an image can be summarized by a set of homogeneous regions in an appropriate feature space. When exact shape is not important, the regions can be represented by sim...
Hayit Greenspan, Guy Dvir, Yossi Rubner
184
Voted
SIGGRAPH
1993
ACM
15 years 10 months ago
Hierarchical Z-buffer visibility
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
Ned Greene, Michael Kass, Gavin S. P. Miller
165
Voted
ICCV
2005
IEEE
16 years 8 months ago
Active Search for Real-Time Vision
In most cases when information is to be extracted from an image, there are priors available on the state of the world and therefore on the detailed measurements which will be obta...
Andrew J. Davison
« Prev « First page 1504 / 1834 Last » Next »