Sciweavers

680 search results - page 105 / 136
» A randomized embedding algorithm for trees
Sort
View
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 5 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 10 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
COMGEO
2004
ACM
13 years 8 months ago
A multi-dimensional approach to force-directed layouts of large graphs
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
GLVLSI
2003
IEEE
129views VLSI» more  GLVLSI 2003»
14 years 2 months ago
A system-level methodology for fast multi-objective design space exploration
In this paper, we address the problem of the efficient exploration of the architectural design space for parameterized systems. Since the design space is multi-objective, our aim ...
Gianluca Palermo, Cristina Silvano, S. Valsecchi, ...
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
14 years 3 months ago
Rule Ensembles for Multi-target Regression
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
Timo Aho, Bernard Zenko, Saso Dzeroski