446 search results - page 46 / 90 » A fast algorithm for computing steiner edge connectivity |
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
IJSNET
2007
13 years 7 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
ISVC
2009
Springer
14 years 2 months ago
2009
Springer
Given a Cylindrical Algebraic Decomposition of an implicit algebraic curve, visualizing distinct curve arcs is not as easy as it stands because, despite the absence of singularitie...
IJON
2008
13 years 7 months ago
2008
In this work we address the problem of boundary detection by combining ideas and approaches from biological and computational vision. Initially, we propose a simple and efficient ...