Sciweavers

3268 search results - page 285 / 654
» The hub number of a graph
Sort
View
PODC
2009
ACM
16 years 7 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
16 years 7 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
LION
2009
Springer
203views Optimization» more  LION 2009»
16 years 1 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
FMCAD
2007
Springer
16 years 27 days ago
Analyzing Gene Relationships for Down Syndrome with Labeled Transition Graphs
Abstract— The relationship between changes in gene expression and physical characteristics associated with Down syndrome is not well understood. Chromosome 21 genes interact with...
Neha Rungta, Hyrum Carroll, Eric G. Mercer, Randal...
ASPDAC
2006
ACM
91views Hardware» more  ASPDAC 2006»
16 years 21 days ago
Fast substrate noise-aware floorplanning with preference directed graph for mixed-signal SOCs
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
Minsik Cho, Hongjoong Shin, David Z. Pan