2374 search results - page 300 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
137
Voted
FUIN
2008
15 years 2 months ago
2008
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
113
Voted
DAC
2005
ACM
15 years 4 months ago
2005
ACM
In this paper, we propose a new sensitivity based, statistical gate sizing method. Since circuit optimization effects the entire shape of the circuit delay distribution, it is dif...
109
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
103
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
100
Voted
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...