Sciweavers

2128 search results - page 108 / 426
» A general characterization of indulgence
Sort
View
DCG
2002
66views more  DCG 2002»
15 years 4 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
SOFSEM
2009
Springer
15 years 9 months ago
Partial Order Semantics of Types of Nets
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the s...
Robert Lorenz, Gabriel Juhás, Sebastian Mau...
DCC
2007
IEEE
16 years 4 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
SACMAT
2009
ACM
15 years 11 months ago
Foundations for group-centric secure information sharing models
We develop the foundations for a theory of Group-Centric Secure Information Sharing (g-SIS), characterize a specific family of models in this arena and identify several direction...
Ram Krishnan, Ravi S. Sandhu, Jianwei Niu, William...
142
Voted
MOBIHOC
2010
ACM
15 years 2 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan