Sciweavers

40 search results - page 8 / 8
» The Jump Classes of Minimal Covers
Sort
View
ECEASST
2006
103views more  ECEASST 2006»
13 years 5 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
RAID
2004
Springer
13 years 10 months ago
HoneyStat: Local Worm Detection Using Honeypots
Worm detection systems have traditionally used global strategies and focused on scan rates. The noise associated with this approach requires statistical techniques and large data s...
David Dagon, Xinzhou Qin, Guofei Gu, Wenke Lee, Ju...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 6 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 5 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
IEEECIT
2010
IEEE
13 years 3 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...