Sciweavers

606 search results - page 101 / 122
» Discrete Time Process Algebra
Sort
View
CSL
2006
Springer
13 years 11 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba
ECCV
2002
Springer
14 years 8 months ago
Using Robust Estimation Algorithms for Tracking Explicit Curves
The context of this work is lateral vehicle control using a camera as a sensor. A natural tool for controlling a vehicle is recursive filtering. The well-known Kalman fil...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...
DCC
2006
IEEE
14 years 7 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
CVPR
2010
IEEE
14 years 2 months ago
Modeling and Estimating Persistent Motion with Geometric Flows
We propose a principled framework to model persistent motion in dynamic scenes. In contrast to previous efforts on object tracking and optical flow estimation that focus on local...
Dahua Lin, Eric Grimson, John Fisher
MSCS
2010
84views more  MSCS 2010»
13 years 6 months ago
Channel abstractions for network security
Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...
Michele Bugliesi, Riccardo Focardi