Sciweavers

2436 search results - page 335 / 488
» Comonadic Notions of Computation
Sort
View
DC
2008
15 years 4 months ago
Sketching asynchronous data streams over sliding windows
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
Bojian Xu, Srikanta Tirthapura, Costas Busch
146
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 4 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
DC
2006
15 years 4 months ago
Dynamic group communication
Group communication is the basic infrastructure for implementing fault-tolerant replicated servers. While group communication is well understood in the context of static systems (...
André Schiper
FMSD
2006
183views more  FMSD 2006»
15 years 4 months ago
An algebraic theory for behavioral modeling and protocol synthesis in system design
The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc sy...
Jean-Pierre Talpin, Paul Le Guernic
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 4 months ago
Matroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
Navin Kashyap