11381 search results - page 143 / 2277 » Connectivity |
134
click to vote
FPL
2008
Springer
15 years 5 months ago
2008
Springer
It is often desirable to change the logic and/or the connections within an FPGA design on-the-fly without the benefit of a workstation or vendor CAD software. This paper presents ...
136
click to vote
CCCG
2007
15 years 5 months ago
2007
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
103
click to vote
HCI
2007
15 years 5 months ago
2007
Accessibility implementation efforts are generally focused towards some typical user impairments and a few interaction devices for a particular user scenario. Whereas there are num...
120
click to vote
IJCAI
2007
15 years 5 months ago
2007
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of...
131
click to vote
OPODIS
2007
15 years 5 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...