1778 search results - page 201 / 356 » On the Power of the Randomized Iterate |
167
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
163
click to vote
PLDI
2010
ACM
16 years 3 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
150
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract—On-chip power density and temperature are rising exponentially with decreasing feature sizes. This alarming trend calls for temperature management at every level of syst...
166
click to vote
CODES
2007
IEEE
16 years 23 days ago
2007
IEEE
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...
159
click to vote
ICPP
2007
IEEE
16 years 22 days ago
2007
IEEE
Compute clusters are consuming more power at higher densities than ever before. This results in increased thermal dissipation, the need for powerful cooling systems, and ultimatel...