Sciweavers

108 search results - page 15 / 22
» Two-Level Push-Relabel Algorithm for the Maximum Flow Proble...
Sort
View
ICCAD
2001
IEEE
201views Hardware» more  ICCAD 2001»
15 years 8 months ago
An Integrated Data Path Optimization for Low Power Based on Network Flow Method
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
Chun-Gi Lyuh, Taewhan Kim, Chien-Liang Liu
103
Voted
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 3 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...
CVIU
2008
180views more  CVIU 2008»
14 years 11 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
BMCBI
2008
132views more  BMCBI 2008»
14 years 11 months ago
Clustering ionic flow blockade toggles with a Mixture of HMMs
Background: Ionic current blockade signal processing, for use in nanopore detection, offers a promising new way to analyze single molecule properties with potential implications f...
Alexander G. Churbanov, Stephen Winters-Hilt
ICCAD
2000
IEEE
188views Hardware» more  ICCAD 2000»
15 years 4 months ago
Bus Optimization for Low-Power Data Path Synthesis Based on Network Flow Method
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
Sungpack Hong, Taewhan Kim