10988 search results - page 193 / 2198 » Algorithmic Folding Complexity |
135
Voted
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
106
Voted
JCO
2010
15 years 2 months ago
2010
Abstract As a generalization of de-disjunct matrices and (w,r;d)-cover-freefamilies, the notion of (s,l)e-disjunct matrices is introduced for error-correcting pooling designs over ...
149
Voted
BIBM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput proteinprot...
119
Voted
ALT
2005
Springer
16 years 17 days ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
174
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...