6562 search results - page 199 / 1313 » Noetherianity and Combination Problems |
213
click to vote
FGR
2011
IEEE
14 years 10 months ago
2011
IEEE
— Matching images with large geometric and iconic changes (e.g. faces under different poses and facial expressions) is an open research problem in computer vision. There are two ...
238
click to vote
IPMI
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. We introduce a novel algorithm for actin filament segmentation in 2D TIRFM image sequences. This problem is difficult because actin filaments dynamically change shapes ...
168
click to vote
CP
2011
Springer
14 years 6 months ago
2011
Springer
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
218
click to vote
PAMI
2012
13 years 9 months ago
2012
—The problem of automatic and optimal design of embedded object detector cascades is considered. Two main challenges are identified: optimization of the cascade configuration and...
175
click to vote
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....