Sciweavers

41 search results - page 8 / 9
» A Hidden Herbrand Theorem
Sort
View
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 9 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
HUC
2010
Springer
13 years 6 months ago
Bayesian recognition of motion related activities with inertial sensors
This work presents the design and evaluation of an activity recognition system for seven important motion related activities. The only sensor used is an Inertial Measurement Unit ...
Korbinian Frank, Maria Josefa Vera Nadales, Patric...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 6 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
TABLEAUX
2009
Springer
14 years 24 days ago
A Novel Architecture for Situation Awareness Systems
Situation Awareness (SA) is the problem of comprehending elements of an environment within a volume of time and space. It is a crucial factor in decision-making in dynamic environm...
Franz Baader, Andreas Bauer 0002, Peter Baumgartne...
TLCA
2009
Springer
14 years 24 days ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer