Sciweavers

118 search results - page 12 / 24
» soda 2008
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 11 months ago
Maintaining deforming surface meshes
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
Siu-Wing Cheng, Tamal K. Dey
SODA
2008
ACM
71views Algorithms» more  SODA 2008»
14 years 11 months ago
Two-phase greedy algorithms for some classes of combinatorial linear programs
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
Ulrich Faigle, Britta Peis
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
SODA
2008
ACM
75views Algorithms» more  SODA 2008»
14 years 11 months ago
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
S. Thomas McCormick, Satoru Fujishige
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...