Sciweavers

3838 search results - page 410 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
ICDAR
2009
IEEE
16 years 1 months ago
Temporal Order Recovery of the Scanned Handwriting
In this paper, we present a new approach to the temporal order restoration of the off-line handwriting. After the preprocessing steps of the word image, a suitable algorithm makes...
Abdelkarim Elbaati, Monji Kherallah, Abdellatif En...
ICASSP
2008
IEEE
16 years 1 months ago
Robust adaptive beamforming using sequential quadratic programming
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
Aboulnasr Hassanien, Sergiy A. Vorobyov, Kon Max W...
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
16 years 1 months ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi
FOCI
2007
IEEE
16 years 1 months ago
Simulated Annealing with Opposite Neighbors
— This paper presents an improvement to the vanilla version of the simulated annealing algorithm by using opposite neighbors. This new technique, is based on the recently propose...
Mario Ventresca, Hamid R. Tizhoosh
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
15 years 10 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig