Sciweavers

51692 search results - page 10230 / 10339
» at 2008
Sort
View
86
Voted
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
14 years 11 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
83
Voted
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
78
Voted
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
101
Voted
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
14 years 11 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
93
Voted
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 11 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
« Prev « First page 10230 / 10339 Last » Next »