Sciweavers

504 search results - page 79 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
HAPTICS
2007
IEEE
15 years 10 months ago
Shaping Event-Based Haptic Transients Via an Improved Understanding of Real Contact Dynamics
Haptic interactions with stiff virtual surfaces feel more realistic when a short-duration transient is added to the spring force at contact. But how should this event-based transi...
Jonathan Fiene, Katherine J. Kuchenbecker
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
15 years 10 months ago
Where's Waldo? Sensor-Based Temporal Logic Motion Planning
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
Hadas Kress-Gazit, Georgios E. Fainekos, George J....
ASIACRYPT
2007
Springer
15 years 10 months ago
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
Jacques Patarin, Valérie Nachef, Côme...
COLT
2007
Springer
15 years 10 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
CSL
2007
Springer
15 years 10 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart