Sciweavers

1172 search results - page 196 / 235
» Path Algorithms on Regular Graphs
Sort
View
GLVLSI
2007
IEEE
187views VLSI» more  GLVLSI 2007»
14 years 4 months ago
DAG based library-free technology mapping
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through t...
Felipe S. Marques, Leomar S. da Rosa Jr., Renato P...
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
14 years 1 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
14 years 3 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
ISBI
2011
IEEE
13 years 1 months ago
Atlas-based fiber clustering for multi-subject analysis of high angular resolution diffusion imaging tractography
High angular resolution diffusion imaging (HARDI) allows in vivo analysis of the white matter structure and connectivity. Based on orientation distribution functions (ODFs) that r...
Gautam Prasad, Neda Jahanshad, Iman Aganj, Christo...
WAW
2007
Springer
91views Algorithms» more  WAW 2007»
14 years 3 months ago
Determining Factors Behind the PageRank Log-Log Plot
Abstract. We study the relation between PageRank and other parameters of information networks such as in-degree, out-degree, and the fraction of dangling nodes. We model this relat...
Yana Volkovich, Nelly Litvak, Debora Donato