Sciweavers

384 search results - page 53 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
86
Voted
ICALP
2009
Springer
16 years 1 days ago
On Regular Temporal Logics with Past,
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
JELIA
2004
Springer
15 years 5 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
85
Voted
CORR
2008
Springer
100views Education» more  CORR 2008»
14 years 12 months ago
Graph-Based Classification of Self-Dual Additive Codes over Finite Fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
Lars Eirik Danielsen
MMSP
2008
IEEE
126views Multimedia» more  MMSP 2008»
15 years 6 months ago
Short utterance-based video aided speaker recognition
—Embedded speaker recognition in mobile devices could involve several ergonomic constraints and a limited amount of computing resources. Even if they have proved their efficienc...
Anthony Larcher, Jean-François Bonastre, Jo...
NIPS
1998
15 years 1 months ago
Coding Time-Varying Signals Using Sparse, Shift-Invariant Representations
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
Michael S. Lewicki, Terrence J. Sejnowski