Sciweavers

1220 search results - page 38 / 244
» Restricting grammatical complexity
Sort
View
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
14 years 1 months ago
The Complexity of Making Unique Choices: Approximating 1-in- k SAT
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
Venkatesan Guruswami, Luca Trevisan
DGCI
2005
Springer
14 years 1 months ago
Increasing Interconnection Network Connectivity for Reducing Operator Complexity in Asynchronous Vision Systems
Due to the restriction of SIMD mode to local operations in VLSI massively parallel vision chips, using programmable connections and asynchronous communications are key ingredients ...
Valentin Gies, Thierry M. Bernard
WABI
2005
Springer
108views Bioinformatics» more  WABI 2005»
14 years 1 months ago
On the Complexity of Several Haplotyping Problems
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 1 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
NIPS
2008
13 years 9 months ago
Simple Local Models for Complex Dynamical Systems
We present a novel mathematical formalism for the idea of a "local model" of an uncontrolled dynamical system, a model that makes only certain predictions in only certai...
Erik Talvitie, Satinder Singh