Sciweavers

1169 search results - page 62 / 234
» Degrees of monotone complexity
Sort
View
MST
2007
167views more  MST 2007»
13 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
CVPR
2004
IEEE
14 years 12 months ago
Atlanta World: An Expectation Maximization Framework for Simultaneous Low-Level Edge Grouping and Camera Calibration in Complex
Edges in man-made environments, grouped according to vanishing point directions, provide single-view constraints that have been exploited before as a precursor to both scene under...
Grant Schindler, Frank Dellaert
ESWA
2008
123views more  ESWA 2008»
13 years 8 months ago
Computing context-dependent temporal diagnosis in complex domains
Over the years, many Artificial Intelligence (AI) approaches have dealt with the diagnosis problem and its application in complex environments such as medical domains. Model-Based...
José M. Juárez, Manuel Campos, Jos&e...
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 4 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
WG
2005
Springer
14 years 3 months ago
On Stable Cutsets in Claw-Free Graphs and Planar Graphs
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
Van Bang Le, Raffaele Mosca, Haiko Müller