604 search results - page 53 / 121 » On the Complexity of the Maximum Cut Problem |
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Representations for interactive photorealistic visualization of scenes range from compact 2D panoramas to dataintensive 4D light fields. In this paper, we propose a technique for ...
MP
2006
14 years 9 months ago
2006
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
AAAI
2000
14 years 11 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
A support vector machine based algorithm for corner detection is presented. It is based on computing the direction of maximum gray-level change for each edge pixel in an image, an...
100
click to vote
DAGM
2008
Springer
14 years 11 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...