Sciweavers

724 search results - page 19 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
15 years 3 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
CSB
2004
IEEE
136views Bioinformatics» more  CSB 2004»
15 years 3 months ago
Minimum Entropy Clustering and Applications to Gene Expression Analysis
Clustering is a common methodology for analyzing the gene expression data. In this paper, we present a new clustering algorithm from an information-theoretic point of view. First,...
Haifeng Li, Keshu Zhang, Tao Jiang
JMLR
2010
211views more  JMLR 2010»
14 years 6 months ago
Minimum Conditional Entropy Clustering: A Discriminative Framework for Clustering
In this paper, we introduce an assumption which makes it possible to extend the learning ability of discriminative model to unsupervised setting. We propose an informationtheoreti...
Bo Dai, Baogang Hu
CVPR
2010
IEEE
15 years 8 months ago
Parallel and Distributed Graph Cuts by Dual Decomposition
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
Petter Strandmark, Fredrik Kahl
ICC
2007
IEEE
15 years 6 months ago
Performance Study of Bandwidth Allocation Techniques for QoS-Constrained Satellite Networks
—The paper analyzes the performance of the bandwidth allocation process over satellite communication systems in presence of specific Quality of Service (QoS) requirements. The re...
Igor Bisio, Mario Marchese