1693 search results - page 34 / 339 » fast 2008 |
TALG
2008
13 years 8 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
WCE
2007
13 years 10 months ago
2007
—This paper presents a multi step-size monic normalization equation-error linear filter. We also extend the idea to nonlinear adaptive filter and derive a multi step-size monic n...
ENTCS
2008
13 years 8 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
IPL
2008
13 years 8 months ago
2008
Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value v that is consistent with all past rounds. Rounds are start...
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first stated in