104 search results - page 20 / 21 » On the Complexity of Some Colorful Problems Parameterized by... |
NIPS
2000
13 years 6 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
APSEC
2006
IEEE
13 years 11 months ago
2006
IEEE
We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...
ATAL
2006
Springer
13 years 9 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
SIAMIS
2011
13 years 8 days ago
2011
We define a novel metric on the space of closed planar curves which decomposes into three intuitive components. According to this metric centroid translations, scale changes and ...
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...