135 search results - page 21 / 27 » Fixed-Point Definability and Polynomial Time |
AAAI
1990
13 years 8 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
EAAI
2008
13 years 7 months ago
2008
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...
MP
2006
13 years 7 months ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
PAMI
2006
13 years 7 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....