Sciweavers

600 search results - page 10 / 120
» Problems and results in extremal combinatorics - II
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
14 years 14 days ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
BMCBI
2010
139views more  BMCBI 2010»
13 years 8 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 7 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
CPM
1998
Springer
84views Combinatorics» more  CPM 1998»
14 years 4 days ago
Genome Halving
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 8 months ago
When do data mining results violate privacy?
Privacy-preserving data mining has concentrated on obtaining valid results when the input data is private. An extreme example is Secure Multiparty Computation-based methods, where...
Murat Kantarcioglu, Jiashun Jin, Chris Clifton