Sciweavers

554 search results - page 32 / 111
» Power Domination Problem in Graphs
Sort
View
SIBGRAPI
2006
IEEE
14 years 1 months ago
Increasing statistical power in medical image analysis
In this paper, we present a novel method for estimating the effective number of independent variables in imaging applications that require multiple hypothesis testing. The method ...
Alexei Manso Correa Machado
ORL
2006
103views more  ORL 2006»
13 years 7 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa
WWW
2003
ACM
14 years 8 months ago
Extrapolation methods for accelerating PageRank computations
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
DAM
2010
137views more  DAM 2010»
13 years 7 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
HPCA
2005
IEEE
14 years 8 months ago
On the Limits of Leakage Power Reduction in Caches
If current technology scaling trends hold, leakage power dissipation will soon become the dominant source of power consumption in high performance processors. Caches, due to the f...
Yan Meng, Timothy Sherwood, Ryan Kastner