Sciweavers

3757 search results - page 372 / 752
» The overlap number of a graph
Sort
View
TCS
2008
15 years 6 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven
IWPC
2010
IEEE
15 years 5 months ago
A Simple and Effective Measure for Complex Low-Level Dependencies
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
Dirk Beyer, Ashgan Fararooy
JSS
2010
89views more  JSS 2010»
15 years 1 months ago
Verification and validation of declarative model-to-model transformations through invariants
In this paper we propose a method to derive OCL invariants from declarative model-to-model transformations in order to enable their verification and analysis. For this purpose we ...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
INFOCOM
2008
IEEE
16 years 1 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel