Sciweavers

4112 search results - page 87 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ISPDC
2005
IEEE
15 years 9 months ago
New Challenges in Parallel Optimization
: Optimization is a healthy field targeted to find efficient solutions and algorithms to solve problems either in the academia and the industry. As the solved problems became harde...
Enrique Alba
WWW
2009
ACM
16 years 4 months ago
Detecting the origin of text segments efficiently
In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of ...
Ossama Abdel Hamid, Behshad Behzadi, Stefan Christ...
CORR
2008
Springer
105views Education» more  CORR 2008»
15 years 4 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 5 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