Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
11 years 11 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
11 years 11 months ago
Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly
DNA self-assembly has emerged as a rich and promising primitive for nano-technology. Experimental and analytical evidence indicates that such systems are prone to errors, and acco...
Ho-Lin Chen, Ashish Goel, Chris Luhrs
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
11 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
69views Algorithms» more  SODA 2008»
11 years 11 months ago
Trace reconstruction with constant deletion probability and related results
Thomas Holenstein, Michael Mitzenmacher, Rina Pani...
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
11 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
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
11 years 11 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
SODA
2008
ACM
79views Algorithms» more  SODA 2008»
11 years 11 months ago
Algorithms for distributed functional monitoring
Graham Cormode, S. Muthukrishnan, Ke Yi
SODA
2008
ACM
80views Algorithms» more  SODA 2008»
11 years 11 months ago
Designing networks with good equilibria
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
11 years 11 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
11 years 11 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber
books