Sciweavers

397 search results - page 75 / 80
» Pseudorandom Functions and Lattices
Sort
View
SAT
2009
Springer
121views Hardware» more  SAT 2009»
15 years 4 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
ICRA
2005
IEEE
122views Robotics» more  ICRA 2005»
15 years 3 months ago
Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions
— A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi pa...
Magnus Lindhé, Petter Ögren, Karl Henr...
CC
2004
Springer
115views System Software» more  CC 2004»
15 years 2 months ago
Periodic Polyhedra
This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning general...
Benoît Meister
PCM
2004
Springer
107views Multimedia» more  PCM 2004»
15 years 2 months ago
Automatic Peak Number Detection in Image Symmetry Analysis
Abstract. In repeated pattern analysis, peak number detection in autocorrelation is of key importance, which subsequently determines the correctness of the constructed lattice. Pre...
Jingrui He, Mingjing Li, HongJiang Zhang, Hanghang...
INAP
2001
Springer
15 years 1 months ago
Towards Reconciling Use Cases via Controlled Language and Graphical Models
Abstract. In requirements engineering use cases are employed to describe the ow of events and the occurrence of states in a future information system. Use cases consist of a set of...
Kathrin Böttger, Rolf Schwitter, Diego Moll&a...