Sciweavers

298 search results - page 21 / 60
» Simplicity in Solving the Frame Problem
Sort
View
DAM
2007
120views more  DAM 2007»
13 years 7 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot
UAI
2008
13 years 9 months ago
Hierarchical POMDP Controller Optimization by Likelihood Maximization
Planning can often be simplified by decomposing the task into smaller tasks arranged hierarchically. Charlin et al. [4] recently showed that the hierarchy discovery problem can be...
Marc Toussaint, Laurent Charlin, Pascal Poupart
STACS
2000
Springer
13 years 11 months ago
The Complexity of Poor Man's Logic
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra
SAMOS
2009
Springer
14 years 2 months ago
Multiple Description Scalable Coding for Video Transmission over Unreliable Networks
Developing real time multimedia applications for best effort networks such as the Internet requires prohibitions against jitter delay and frame loss. This problem is further compl...
Roya Choupani, Stephan Wong, Mehmet R. Tolun
IEEEMSP
2002
IEEE
14 years 20 days ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...