Sciweavers

19 search results - page 2 / 4
» A characterization of regular expressions under bisimulation
Sort
View
IISWC
2008
IEEE
15 years 4 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley
ICC
2007
IEEE
118views Communications» more  ICC 2007»
15 years 3 months ago
A Class of LDPC Erasure Distributions with Closed-Form Threshold Expression
— In this paper, a family of low-density parity-check (LDPC) degree distributions, whose decoding threshold on the binary erasure channel (BEC) admits a simple closed form, is pr...
Enrico Paolini, Marco Chiani
IANDC
2010
132views more  IANDC 2010»
14 years 7 months ago
The expressive power of the shuffle product
There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious opera...
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Er...
TOCL
2002
96views more  TOCL 2002»
14 years 9 months ago
On first-order topological queries
One important class of spatial database queries is the class of topological queries, that is, queries invariant under homeomorphisms. Westudy topological queries expressible in th...
Martin Grohe, Luc Segoufin
CORR
2007
Springer
79views Education» more  CORR 2007»
14 years 9 months ago
Logic Meets Algebra: the Case of Regular Languages
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
Pascal Tesson, Denis Thérien