Sciweavers

62 search results - page 3 / 13
» Closed k-stop distance in graphs
Sort
View
ASPDAC
2005
ACM
105views Hardware» more  ASPDAC 2005»
13 years 8 months ago
Interconnect estimation without packing via ACG floorplans
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...
Jia Wang, Hai Zhou
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
14 years 2 months ago
ACG-Adjacent Constraint Graph for General Floorplans
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...
Hai Zhou, Jia Wang
GD
2004
Springer
13 years 11 months ago
Distributed Graph Layout for Sensor Networks
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor w...
Craig Gotsman, Yehuda Koren
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 29 days ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
IPL
2010
65views more  IPL 2010»
13 years 4 months ago
Multicasting in the hypercube, chord and binomial graphs
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
Christopher C. Cipriano, Teofilo F. Gonzalez