Sciweavers

2412 search results - page 252 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
134
Voted
ECCV
2004
Springer
16 years 5 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
106
Voted
ICCV
2007
IEEE
16 years 5 months ago
Detecting Illumination in Images
In this paper we present a surprisingly simple yet powerful method for detecting illumination--determining which pixels are lit by different lights--in images. Our method is based...
Clément Fredembach, Graham D. Finlayson, Ma...
PAMI
2002
149views more  PAMI 2002»
15 years 3 months ago
Region Tracking via Level Set PDEs without Motion Computation
Tracking regions in an image sequence is a challenging and di cult problem in image processing and computer vision, and at the same time, one that has many important applications:...
Abdol-Reza Mansouri
121
Voted
ECAI
2004
Springer
15 years 9 months ago
Tractability Results for Automatic Contracting
Abstract. Automated negotiation techniques have received considerable attention over the past decade, and much progress has been made in developing negotiation protocols and strate...
Paul E. Dunne, Michael Laurence, Michael Wooldridg...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 4 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar