Sciweavers

604 search results - page 53 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
CVPR
2007
IEEE
16 years 7 months ago
Layered Depth Panoramas
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 ...
Ke Colin Zheng, Sing Bing Kang, Michael F. Cohen, ...
MP
2006
87views more  MP 2006»
15 years 5 months ago
Convexity and decomposition of mean-risk stochastic programs
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...
Shabbir Ahmed
AAAI
2000
15 years 7 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
ICPR
2004
IEEE
16 years 7 months ago
Corner Detection Using Support Vector Machines
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...
Malay K. Kundu, Minakshi Banerjee, Pabitra Mitra
DAGM
2008
Springer
15 years 7 months ago
Approximate Parameter Learning in Conditional Random Fields: An Empirical Investigation
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...
Filip Korc, Wolfgang Förstner