3471 search results - page 316 / 695 » Obstacle Numbers of Graphs |
165
click to vote
ASPDAC
2006
ACM
16 years 21 days ago
2006
ACM
— 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...
168
click to vote
SIGECOM
2006
ACM
16 years 21 days ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
181
click to vote
WEBI
2005
Springer
16 years 6 days ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
192
click to vote
EMMCVPR
2003
Springer
15 years 12 months ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
169
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...