Sciweavers

514 search results - page 39 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
ACL
2007
13 years 10 months ago
Mildly Context-Sensitive Dependency Languages
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
Marco Kuhlmann, Mathias Möhl
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
IPL
2008
65views more  IPL 2008»
13 years 8 months ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart
SIGSOFT
1993
ACM
14 years 22 days ago
Scalable Software Libraries
1 Many software libraries (e.g., the Booch C++ Components, libg++, NIHCL, COOL) provide components (classes) that implement data structures. Each component is written by hand and r...
Don S. Batory, Vivek Singhal, Marty Sirkin, Jeff T...
WABI
2010
Springer
128views Bioinformatics» more  WABI 2010»
13 years 7 months ago
Sparsification of RNA Structure Prediction Including Pseudoknots
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...
Mathias Möhl, Raheleh Salari, Sebastian Will,...