Sciweavers

2312 search results - page 89 / 463
» The complexity of estimating min-entropy
Sort
View
CIBB
2008
14 years 1 months ago
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
Alberto Bertoni, Giorgio Valentini
NIPS
2007
14 years 17 days ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
14 years 15 days ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
BIOINFORMATICS
2010
109views more  BIOINFORMATICS 2010»
13 years 11 months ago
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters
Phylogenetic trees are widely used to display estimates of how groups of species evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species ...
Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H...
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 11 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky