1162 search results - page 70 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
PAMI
2010
13 years 6 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
DAC
2006
ACM
14 years 9 months ago
2006
ACM
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
ICN
2005
Springer
14 years 1 months ago
2005
Springer
A strategy for energy saving in wireless sensor networks is to manage the duty cycle of sensors, by dynamically selecting a different set of nodes to be active in every moment. We ...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—The second-order cyclostationarity of cyclically prefixed single carrier linear digital (CP-SCLD) modulated signals is investigated with emphasis on its applicability to signal ...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...