Sciweavers

1772 search results - page 120 / 355
» Classifying Problems into Complexity Classes
Sort
View
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
15 years 11 months ago
On LQG joint optimal scheduling and control under communication constraints
Abstract— In this paper, we consider a discrete-time stochastic system, where sensor measurements are sent over a network to the controller. The design objective is a non-classic...
Adam Molin, Sandra Hirche
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 6 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
ECCC
2011
217views ECommerce» more  ECCC 2011»
14 years 10 months ago
ReachFewL = ReachUL
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
Brady Garvin, Derrick Stolee, Raghunath Tewari, N....
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
16 years 29 days ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
CVPR
2003
IEEE
16 years 8 months ago
Recognising and Monitoring High-Level Behaviours in Complex Spatial Environments
The recognition of activities from sensory data is important in advanced surveillance systems to enable prediction of high-level goals and intentions of the target under surveilla...
Nam Thanh Nguyen, Hung Hai Bui, Svetha Venkatesh, ...