Sciweavers

3172 search results - page 105 / 635
» New developments of the Z-EDM algorithm
Sort
View
ICPR
2000
IEEE
16 years 4 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 10 months ago
Multiply-Recursive Upper Bounds with Higman's Lemma
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that re...
Sylvain Schmitz, Philippe Schnoebelen
IACR
2011
124views more  IACR 2011»
14 years 3 months ago
Using the Cloud to Determine Key Strengths
We develop a new methodology to assess cryptographic key strength using cloud computing, by calculating the true economic cost of (symmetric- or private-) key retrieval for the mos...
Thorsten Kleinjung, Arjen K. Lenstra, Dan Page, Ni...
133
Voted
IPPS
2002
IEEE
15 years 8 months ago
Concept-Based Component Libraries and Optimizing Compilers
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...
Sibylle Schupp, D. P. Gregor, B. Osman, David R. M...
CEC
2005
IEEE
15 years 5 months ago
DynDE: a differential evolution for dynamic optimization problems
Abstract- This paper presents an approach of using Differential Evolution (DE) to solve dynamic optimization problems. Careful setting of parameters is necessary for DE algorithms ...
Rui Mendes, Arvind S. Mohais