4860 search results - page 21 / 972 » SNPs Problems, Complexity, and Algorithms |
APPROX
2004
Springer
14 years 27 days ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
JMLR
2008
13 years 7 months ago
2008
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
ENDM
2010
13 years 4 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
ECAI
2004
Springer
14 years 27 days ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...