Sciweavers

1404 search results - page 88 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
Robust Object Pose Estimation via Statistical Manifold Modeling
We propose a novel statistical manifold modeling approach that is capable of classifying poses of object categories from video sequences by simultaneously minimizing the intra-cla...
Liang Mei, Jingen Liu, Alfred Hero, Silvio Savares...
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 2 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
IPL
2006
69views more  IPL 2006»
14 years 9 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...
FOCS
2007
IEEE
15 years 4 months ago
On the Optimality of Planar and Geometric Approximation Schemes
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
Dániel Marx
JAIR
2008
111views more  JAIR 2008»
14 years 9 months ago
New Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
Michael Katz, Carmel Domshlak