Sciweavers

2465 search results - page 97 / 493
» Automata on Linear Orderings
Sort
View
IPL
2008
109views more  IPL 2008»
13 years 9 months ago
Description and analysis of a bottom-up DFA minimization algorithm
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
Jorge Almeida, Marc Zeitoun
CORR
2007
Springer
78views Education» more  CORR 2007»
13 years 9 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber
ICIP
2005
IEEE
14 years 10 months ago
Spiral coding order of macroblocks with applications to SNR-scalable video compression
- Video sequences are compressed by processing individual macroblocks within frames. Traditional macroblock order of processing is linear from the left to the right, and from the t...
Lukasz Blaszak, Marek Domanski
DSN
2006
IEEE
14 years 3 months ago
High Throughput Total Order Broadcast for Cluster Environments
Total order broadcast is a fundamental communication primitive that plays a central role in bringing cheap software-based high availability to a wide array of services. This paper...
Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Viv...
ASIACRYPT
2004
Springer
14 years 2 months ago
Higher Order Universal One-Way Hash Functions
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from ...
Deukjo Hong, Bart Preneel, Sangjin Lee