1984 search results - page 141 / 397 » The colourful feasibility problem |
134
click to vote
ML
2002
ACM
15 years 5 months ago
2002
ACM
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered. This is done by minimizing some estimates of the gener...
140
Voted
PAMI
2007
15 years 5 months ago
2007
This paper introduces a novel approach for solving the problem of camera calibration from spheres. By exploiting the relationship between the dual images of spheres and the dual i...
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
—Inspired by the simplicity of how nature solves its problems, we implement a bacteria controller on a physical platform that would enable the localisation and subsequent mapping...
147
click to vote
OOPSLA
2010
Springer
15 years 4 months ago
2010
Springer
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are ob...
180
click to vote
ESSLLI
2009
Springer
15 years 3 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...