Sciweavers

3105 search results - page 93 / 621
» The Path-Packing Structure of Graphs
Sort
View
TIT
2010
138views Education» more  TIT 2010»
14 years 10 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 6 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
FASE
2001
Springer
15 years 7 months ago
Strengthening UML Collaboration Diagrams by State Transformations
Abstract. Collaboration diagrams as described in the official UML documents specify patterns of system structure and interaction. In this paper, we propose their use for specifying...
Reiko Heckel, Stefan Sauer
WWW
2003
ACM
16 years 3 months ago
Data-Sharing Relationships in the Web
We propose a novel structure, the data-sharing graph, for characterizing sharing patterns in large-scale data distribution systems. We analyze this structure in two such systems a...
Adriana Iamnitchi, Matei Ripeanu, Ian T. Foster
COLING
2000
15 years 4 months ago
Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
Marc Dymetman, Frédéric Tendeau