Sciweavers

2200 search results - page 367 / 440
» Bloch's Constant is Computable
Sort
View
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
15 years 10 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é...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ICALP
2009
Springer
15 years 10 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
PPOPP
2010
ACM
15 years 7 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
15 years 4 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid