1629 search results - page 314 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
WACV
2008
IEEE
15 years 4 months ago
2008
IEEE
deliver objects, handle emergency, wherever he/she is inside the home. In addition, the burden of processing We address issues dealing with distributed visual power can be distribu...
112
click to vote
DATAMINE
2006
14 years 9 months ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
88
Voted
ISLPED
1997
ACM
15 years 1 months ago
1997
ACM
The energy consumption of a system depends upon the hardware and software component of a system. Since it is the software which drives the hardware in most systems, decisions take...
TCAD
1998
14 years 9 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...