Sciweavers

1199 search results - page 119 / 240
» Parameterized Proof Complexity
Sort
View
WG
2005
Springer
14 years 3 months ago
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
Guillaume Blin, Guillaume Fertin, Danny Hermelin, ...
CIKM
2004
Springer
14 years 3 months ago
A design space approach to analysis of information retrieval adaptive filtering systems
In this paper we suggest a new approach to analysis and design of IR systems. We argue for design space exploration in constructing IR systems and in analyzing the effects of ind...
Dmitriy Fradkin, Paul B. Kantor
MPC
2004
Springer
165views Mathematics» more  MPC 2004»
14 years 3 months ago
Prototyping Generic Programming in Template Haskell
Abstract. Generic Programming deals with the construction of programs that can be applied to many dierent datatypes. This is achieved by parameterizing the generic programs by the...
Ulf Norell, Patrik Jansson
SAS
2004
Springer
105views Formal Methods» more  SAS 2004»
14 years 3 months ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Cormac Flanagan, Stephen N. Freund
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 3 months ago
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider