Sciweavers

922 search results - page 55 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 7 months ago
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
Florian Richoux
JCT
2011
83views more  JCT 2011»
13 years 5 months ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine
JSYML
2011
89views more  JSYML 2011»
13 years 5 months ago
Iterative differential Galois theory in positive characteristic: A model theoretic approach
Abstract. This paper introduces a natural extension of Kolchin’s differential Galois theory to positive characteristic iterative differential fields, generalizing to the non-li...
Javier Moreno
SIGSOFT
2010
ACM
13 years 5 months ago
Language-based verification will change the world
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We expl...
Tim Sheard, Aaron Stump, Stephanie Weirich
TSP
2010
13 years 5 months ago
A multi-resolution hidden Markov model using class-specific features
We address the problem in signal classification applications, such as automatic speech recognition (ASR) systems that employ the hidden Markov model (HMM), that it is necessary to...
Paul M. Baggenstoss