Sciweavers

412 search results - page 2 / 83
» A New Proof of the F5 Algorithm
Sort
View
SIAMJO
2010
89views more  SIAMJO 2010»
13 years 1 days ago
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
Roberto Andreani, José Mario Martíne...
ISCAS
2005
IEEE
139views Hardware» more  ISCAS 2005»
13 years 11 months ago
The missing observations theorem and a new proof of Levinson's recursion
— A principle of linear mean-square estimation which we call the “missing observations theorem” is presented here and used to provide a simple alternative derivation of Levin...
Charles W. Therrien
PR
2007
111views more  PR 2007»
13 years 4 months ago
Design and formal proof of a new optimal image segmentation program with hypermaps
This article presents the design of a new functional 2D image segmentation algorithm by cell merging in a subdivision, its proof of total correctness, and the derivation of an opt...
Jean-François Dufourd
WDAG
2001
Springer
104views Algorithms» more  WDAG 2001»
13 years 9 months ago
A New Synchronous Lower Bound for Set Agreement
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
IPL
2007
105views more  IPL 2007»
13 years 5 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk