Sciweavers

4850 search results - page 157 / 970
» Proof and Computation in Geometry
Sort
View
ICCS
2009
Springer
15 years 4 months ago
Bending Virtual Spring-Damper: A Solution to Improve Local Platoon Control
This article presents a local control approach to linear vehicle platooning. Linear platoon systems are sets of vehicles that use local or global perception capabilities to form a ...
Jean-Michel Contet, Franck Gechter, Pablo Gruer, A...
FOCS
1999
IEEE
15 years 10 months ago
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
Amit Sahai
TPHOL
1996
IEEE
15 years 10 months ago
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
Bernhard Reus
SMA
2008
ACM
136views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Kinematic convexity of spherical displacements and its application to collision prediction
In recent years, there has been an increasing interest in developing geometric algorithms for kinematic computations. The aim of this paper is to present the notion of kinematic c...
Qiaode Jeffrey Ge, Anurag Purwar, Jun Wu
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
16 years 1 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret