Sciweavers

4114 search results - page 101 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CORR
2008
Springer
105views Education» more  CORR 2008»
15 years 5 months ago
Interior-Point Algorithms for Linear-Programming Decoding
Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of ...
Pascal O. Vontobel
FAW
2008
Springer
137views Algorithms» more  FAW 2008»
15 years 6 months ago
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
Guoqiang Bai 0002, Henning Fernau
MEMICS
2010
14 years 11 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
ACIIDS
2012
IEEE
307views Database» more  ACIIDS 2012»
14 years 20 days ago
A Hybrid Evolutionary Imperialist Competitive Algorithm (HEICA)
This paper proposes a new approach by combining the Evolutionary Algorithm and Imperialist Competitive Algorithm. This approach tries to capture several people involved in communit...
Fatemeh Ramezani, Shahriar Lotfi, M. A. Soltani-Sa...
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
15 years 2 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo