Sciweavers

7109 search results - page 158 / 1422
» Process Algebra with Combinators
Sort
View
125
Voted
FSTTCS
2003
Springer
15 years 8 months ago
Reachability Analysis of Process Rewrite Systems
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
Ahmed Bouajjani, Tayssir Touili
113
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Multistream speaker diarization through Information Bottleneck system outputs combination
Speaker diarization of meetings recorded with Multiple Distant Microphones makes extensive use of multiple feature streams like MFCC and Time Delay of Arrivals (TDOA). Typically t...
Deepu Vijayasenan, Fabio Valente, Petr Motlí...
207
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 4 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
132
Voted
CIDR
2009
98views Algorithms» more  CIDR 2009»
15 years 4 months ago
From Declarative Languages to Declarative Processing in Computer Games
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
Ben Sowell, Alan J. Demers, Johannes Gehrke, Nitin...
FAC
2008
114views more  FAC 2008»
15 years 3 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe