Sciweavers

10988 search results - page 263 / 2198
» Algorithmic Folding Complexity
Sort
View
MOC
2011
14 years 11 months ago
Fast evaluation of modular functions using Newton iterations and the AGM
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
Régis Dupont
118
Voted
COCOON
2009
Springer
15 years 10 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
SSS
2007
Springer
106views Control Systems» more  SSS 2007»
15 years 10 months ago
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
ICASSP
2007
IEEE
15 years 10 months ago
Rate Allocation Algorithm for Pixel-Domain Distributed Video Coding Without Feedback Channel
In some video coding applications, it is desirable to reduce the complexity of the video encoder at the expense of a more complex decoder. Distributed Video (DV) Coding is a new p...
Marleen Morbée, Josep Prades-Nebot, Aleksan...
JMLR
2010
118views more  JMLR 2010»
14 years 11 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano