10988 search results - page 1803 / 2198 » Algorithmic Folding Complexity |
177
click to vote
CPM
2009
Springer
15 years 11 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
154
click to vote
CSR
2009
Springer
15 years 11 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
157
click to vote
DIS
2009
Springer
15 years 11 months ago
2009
Springer
Motivated by the need for unification of the domain of data mining and the demand for formalized representation of outcomes of data mining investigations, we address the task of c...
144
click to vote
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
140
click to vote
FC
2009
Springer
15 years 11 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...