Sciweavers

2465 search results - page 55 / 493
» Automata on Linear Orderings
Sort
View
ASIACRYPT
2010
Springer
13 years 5 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
HYBRID
2003
Springer
14 years 1 months ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
EVOW
2005
Springer
14 years 1 months ago
An Evolutionary Infection Algorithm for Dense Stereo Correspondence
This work presents an evolutionary approach to improve the infection algorithm to solve the problem of dense stereo matching. Dense stereo matching is used for 3D reconstruction in...
Cynthia B. Pérez, Gustavo Olague, Francisco...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 8 months ago
XPath Whole Query Optimization
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
Sebastian Maneth, Kim Nguyen