Sciweavers

1201 search results - page 171 / 241
» Linear Probing and Graphs
Sort
View
CODES
2006
IEEE
15 years 2 months ago
Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...
Maarten Wiggers, Marco Bekooij, Pierre G. Jansen, ...
108
Voted
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 2 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze
DAGSTUHL
2007
15 years 2 months ago
A Deeper Investigation of PageRank as a Function of the Damping Factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
109
Voted
SIROCCO
2007
15 years 2 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
79
Voted
CCCG
2009
15 years 1 months ago
Generalized jewels and the point placement problem
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sark...