Sciweavers

900 search results - page 109 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
DCOSS
2006
Springer
14 years 13 days ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
QEST
2007
IEEE
14 years 3 months ago
Qualitative Logics and Equivalences for Probabilistic Systems
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
Luca de Alfaro, Krishnendu Chatterjee, Marco Faell...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
14 years 26 days ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
FLAIRS
2008
13 years 11 months ago
Learning in the Lexical-Grammatical Interface
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
Tom Armstrong, Tim Oates
IJCV
2007
179views more  IJCV 2007»
13 years 8 months ago
Global Detection of Salient Convex Boundaries
As an important geometric property of many structures or structural components, convexity plays an important role in computer vision and image understanding. In this paper, we desc...
Song Wang, Joachim S. Stahl, Adam Bailey, Michael ...