Sciweavers

359 search results - page 34 / 72
» The Parameterized Complexity of Counting Problems
Sort
View
TIP
2008
89views more  TIP 2008»
13 years 7 months ago
Snakuscules
Abstract--A snakuscule (a minuscule snake) is the simplest active contour that we were able to design while keeping the quintessence of traditional snakes: an energy term governed ...
Philippe Thévenaz, Michael Unser
IWPC
2010
IEEE
13 years 6 months ago
A Simple and Effective Measure for Complex Low-Level Dependencies
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
Dirk Beyer, Ashgan Fararooy
AIPS
2006
13 years 9 months ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss
ICTAI
2005
IEEE
14 years 1 months ago
Good Learning and Implicit Model Enumeration
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
António Morgado, João P. Marques Sil...
CDC
2009
IEEE
127views Control Systems» more  CDC 2009»
13 years 11 months ago
A new perspective on control of uncertain complex systems
— In this article, we investigate a new class of control problems called Ensemble Control, a notion coming from the study of complex spin dynamics in Nuclear Magnetic Resonance (...
Shin Li