15033 search results - page 418 / 3007 » Complexity Theory and Algorithms |
163
Voted
JCO
2010
15 years 6 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 ...
225
Voted
BIBM
2010
IEEE
15 years 5 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...
217
Voted
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
183
Voted
ALT
2005
Springer
16 years 4 months 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 ...
262
Voted
ISAAC
2005
Springer
16 years 1 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...