1162 search results - page 43 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
129
click to vote
DSD
2006
IEEE
15 years 10 months ago
2006
IEEE
The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such system...
177
click to vote
MST
2010
14 years 10 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
147
click to vote
ISPD
2004
ACM
15 years 9 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
140
Voted
RTSS
2009
IEEE
15 years 10 months ago
2009
IEEE
—Data delivery is a major function of sensor network applications. Many applications, such as military surveillance, require the detection of interested events to be reported to ...
144
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...