Sciweavers

849 search results - page 14 / 170
» The Early Restart Algorithm
Sort
View
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
15 years 2 months ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin
NA
2008
203views more  NA 2008»
14 years 10 months ago
Block Krylov-Schur method for large symmetric eigenvalue problems
Stewart's Krylov-Schur algorithm offers two advantages over Sorensen's implicitly restarted Arnoldi (IRA) algorithm. The first is ease of deflation of converged Ritz vect...
Yunkai Zhou, Yousef Saad
EDCC
2010
Springer
15 years 2 months ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal
CVPR
2004
IEEE
16 years 4 days ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
PRDC
2009
IEEE
15 years 4 months ago
An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
Abstract—In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the av...
Antonio Fernández Anta, Miguel A. Mosteiro,...