Sciweavers

1176 search results - page 6 / 236
» Implicit Abstraction Heuristics
Sort
View
IJCV
2010
170views more  IJCV 2010»
13 years 8 months ago
Implicit Moment Invariants
Abstract The use of traditional moment invariants in object recognition is limited to simple geometric transforms, such as rotation, scaling and affine transformation of the image...
Jan Flusser, Jaroslav Kautsky, Filip Sroubek
DATE
2005
IEEE
117views Hardware» more  DATE 2005»
14 years 3 months ago
Implicit and Exact Path Delay Fault Grading in Sequential Circuits
1 The first path implicit and exact non–robust path delay fault grading technique for non–scan sequential circuits is presented. Non enumerative exact coverage is obtained, b...
Mahilchi Milir Vaseekar Kumar, Spyros Tragoudas, S...
FSTTCS
2008
Springer
13 years 11 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 11 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
EOR
2006
134views more  EOR 2006»
13 years 9 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...