1629 search results - page 26 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
DAC
2009
ACM
15 years 10 months ago
2009
ACM
Power consumption of system-level on-chip communications is becoming more significant in the overall system-on-chip (SoC) power as technology scales down. In this paper, we propos...
84
Voted
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
134
click to vote
CRV
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
IPCCC
2007
IEEE
15 years 4 months ago
2007
IEEE
To offset the significant power demands of hard disk drives in computer systems, drives are typically powered down during idle periods. This saves power, but accelerates duty cyc...
155
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...