2374 search results - page 310 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
100
Voted
CLUSTER
2008
IEEE
15 years 9 months ago
2008
IEEE
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
140
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
98
Voted
DAC
2007
ACM
16 years 3 months ago
2007
ACM
In this paper we address the the growing issue of junction tunneling leakage (Ijunc) at the circuit level. Specifically, we develop a fast approach to analyze the state-dependent ...
155
Voted
EUROCAST
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper presents an efficient technique for real time estimation of on-board stereo vision system pose. The whole process is performed in the Euclidean space and consi...
111
Voted
IPPS
1994
IEEE
15 years 6 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...