2343 search results - page 406 / 469 » Visual-Concept Search Solved |
160
click to vote
SARA
2009
Springer
15 years 11 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
174
Voted
SCIA
2009
Springer
15 years 11 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
122
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
135
Voted
CLEAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents our participation in the CLEAR 07 evaluation workshop head pose estimation tasks where two head pose estimation tasks were to be addressed. The first...
140
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...