Sciweavers

28888 search results - page 5680 / 5778
» Computability and complexity in analysis
Sort
View
EUROCRYPT
2007
Springer
14 years 3 months ago
Feistel Networks Made Public, and Applications
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
Yevgeniy Dodis, Prashant Puniya
FASE
2007
Springer
14 years 3 months ago
Activity-Driven Synthesis of State Machines
The synthesis of object behaviour from scenarios is a well-known and important issue in the transition from system analysis to system design. We describe a model transformation pro...
Rolf Hennicker, Alexander Knapp
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 3 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 3 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
IBPRIA
2007
Springer
14 years 3 months ago
Dimensionless Monocular SLAM
Abstract. It has recently been demonstrated that the fundamental computer vision problem of structure from motion with a single camera can be tackled using the sequential, probabil...
Javier Civera, Andrew J. Davison, J. M. M. Montiel
« Prev « First page 5680 / 5778 Last » Next »