Sciweavers

118 search results - page 21 / 24
» soda 2008
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
SODA
2008
ACM
109views Algorithms» more  SODA 2008»
14 years 11 months ago
Auctions for structured procurement
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
14 years 11 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
14 years 11 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
14 years 11 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...