2374 search results - page 10 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
ISBI
2002
IEEE
14 years 8 months ago
2002
IEEE
We investigate a new, fast and provably convergentMAP reconstruction algorithm for emission tomography. The new algorithm, termed C-OSEM has its origin in the alternating algorith...
WSCG
2004
13 years 9 months ago
2004
The purpose of this paper is twofold: to propose two fast distribution functions for spotlights and to use terminology used in stage lighting to model these luminaries. In OpenGL ...
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
TON
2010
13 years 6 months ago
2010
— We adopt the network coding approach to achieve minimum-cost multicast in interference-limited wireless networks where link capacities are functions of the signal-to-noise-plus...