876 search results - page 5 / 176 » New Results for the Martin Polynomial |
CORR
2011
Springer
13 years 10 days ago
2011
Springer
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...
CVPR
1998
IEEE
14 years 9 months ago
1998
IEEE
New representations are developed for 2D IP (implicit polynomial) curves ofarbitrary degree. These representations permit shape recognition and pose estimation with essentially sin...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
RTA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...