Sciweavers

1629 search results - page 109 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
PODC
2012
ACM
13 years 11 days ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
EMSOFT
2005
Springer
15 years 3 months ago
A sink-n-hoist framework for leakage power reduction
Power leakage constitutes an increasing fraction of the total power consumption in modern semiconductor technologies. Recent research efforts have tried to integrate architecture...
Yi-Ping You, Chung-Wen Huang, Jenq Kuen Lee
ISPD
2007
ACM
124views Hardware» more  ISPD 2007»
14 years 11 months ago
Accurate power grid analysis with behavioral transistor network modeling
In this paper, we propose fast and efficient techniques to analyze the power grid with accurate modeling of the transistor network. The solution techniques currently available for...
Anand Ramalingam, Giri Devarayanadurg, David Z. Pa...
MOR
2002
94views more  MOR 2002»
14 years 9 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
CVPR
2005
IEEE
15 years 12 months ago
Digital Tapestry
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
Carsten Rother, Sanjiv Kumar, Vladimir Kolmogorov,...