1523 search results - page 57 / 305 » The Computational Complexity of Linear Optics |
146
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
159
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Event-triggered control systems are systems in which the control signal is recomputed when the plant's output signal leaves a triggering-set. There has been recent interest in...
136
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
196
click to vote
CVPR
1997
IEEE
15 years 10 months ago
1997
IEEE
ÐWe describe a new direct method for estimating structure and motion from image intensities of multiple views. We extend the direct methods of Horn and Weldon [18] to three views....
194
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...