Sciweavers

173 search results - page 28 / 35
» A Proof of the Two-path Conjecture
Sort
View
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
14 years 9 months ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
MOBICOM
2006
ACM
14 years 2 months ago
Coverage and connectivity in three-dimensional networks
Although most wireless terrestrial networks are based on twodimensional (2D) design, in reality, such networks operate in threedimensions (3D). Since most often the size (i.e., th...
S. M. Nazrul Alam, Zygmunt J. Haas
SEMWIKI
2008
154views Data Mining» more  SEMWIKI 2008»
13 years 10 months ago
Flyspeck in a Semantic Wiki
Abstract. Semantic wikis have been successfully applied to many problems in knowledge management and collaborative authoring. They are particularly appropriate for scientific and m...
Christoph Lange 0002, Sean McLaughlin, Florian Rab...
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 9 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
STACS
2009
Springer
14 years 3 months ago
Hardness and Algorithms for Rainbow Connectivity
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...