Sciweavers

412 search results - page 32 / 83
» A New Proof of the F5 Algorithm
Sort
View
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
14 years 4 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner
RECOMB
2006
Springer
15 years 10 months ago
Sorting by Translocations Via Reversals Theory
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
Michal Ozery-Flato, Ron Shamir
DCG
2010
132views more  DCG 2010»
14 years 10 months ago
Delaunay Refinement for Piecewise Smooth Complexes
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos
FM
2008
Springer
148views Formal Methods» more  FM 2008»
14 years 11 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
STACS
2007
Springer
15 years 3 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald