Sciweavers

10414 search results - page 3 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
STRINGOLOGY
2008
13 years 7 months ago
Efficient Variants of the Backward-Oracle-Matching Algorithm
In this article we present two efficient variants of the BOM string matching algorithm which are more efficient and flexible than the original algorithm. We also present bit-parall...
Simone Faro, Thierry Lecroq
DCC
2005
IEEE
14 years 5 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
13 years 9 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...
SCL
2008
82views more  SCL 2008»
13 years 5 months ago
An efficient algorithm for positive realizations
We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions...
Wojciech Czaja, Philippe Jaming, Máté...