874 search results - page 87 / 175 » Faster Algorithms for Semi-Matching Problems |
ICCS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Discovering gene co-regulatory relationships is a new but important research problem in DNA microarray data analysis. The problem of gene specific co-regulation discovery...
107
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
101
click to vote
PKC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...