2434 search results - page 96 / 487 » Algorithmic Randomness of Closed Sets |
118
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
128
Voted
CIS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. As a novel research direction, privacy-preserving data mining (PPDM) has received a great deal of attentions from more and more researchers, and a large number of PPDM al...
149
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
124
click to vote
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
A vast amount of documents in the Web have duplicates, which is a challenge for developing efficient methods that would compute clusters of similar documents. In this paper we use ...
125
click to vote
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...