843 search results - page 129 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
ECCV
2010
Springer
13 years 11 months ago
2010
Springer
In this work we investigate an inverse geometry problem. Given a light source, a diffuse plane and a caustic image, how must a geometric object look like (transmissive or reflect...
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...
FLAIRS
2003
13 years 8 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
NCA
2008
IEEE
13 years 7 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...