Sciweavers

539 search results - page 26 / 108
» The N R One Time Password System
Sort
View
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
14 years 11 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
DATE
2007
IEEE
223views Hardware» more  DATE 2007»
15 years 4 months ago
CARAT: a toolkit for design and performance analysis of component-based embedded systems
Solid frameworks and toolkits for design and analysis of embedded systems are of high importance, since they enable early reasoning about critical properties of a system. This pap...
Egor R. V. Bondarev, Michel R. V. Chaudron, Peter ...
SIAMAM
2002
72views more  SIAMAM 2002»
14 years 9 months ago
Desorption Overshoot in Polymer-Penetrant Systems: Asymptotic and Computational Results
Many practically relevant polymers undergoing desorption change from the rubbery (saturated) to the glassy (nearly dry) state. The dynamics of such systems cannot be described by t...
David A. Edwards, Richard A. Cairncross
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
14 years 9 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
88
Voted
JCSS
2010
114views more  JCSS 2010»
14 years 8 months ago
FPT algorithms and kernels for the Directed k-Leaf problem
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
Jean Daligault, Gregory Gutin, Eun Jung Kim, Ander...