Sciweavers

267 search results - page 15 / 54
» his 2008
Sort
View
DEDS
2008
94views more  DEDS 2008»
13 years 10 months ago
Approximate Simulation Relations for Hybrid Systems
Abstract Approximate simulation relations have recently been introduced as a powerful tool for the approximation of discrete and continuous systems. In this paper, we his abstracti...
Antoine Girard, A. Agung Julius, George J. Pappas
JCSS
2008
62views more  JCSS 2008»
13 years 10 months ago
Maximal repetitions in strings
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...
Maxime Crochemore, Lucian Ilie
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
13 years 10 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
TGIS
2008
61views more  TGIS 2008»
13 years 10 months ago
Transformations of Cadastral Descriptions with Incomplete Information into Maps
in Joel's piece, but this really does not account for what the research actually accomplished. While I enjoyed his article and the references to "Officialdom" that w...
Marina Mueller
COMCOM
1998
81views more  COMCOM 1998»
13 years 10 months ago
Secure broadcasting in large networks
In this note, we show that a proposed secure broadcasting scheme is insecure. We also present a modified scheme to overcome this weakness. The modified scheme has the extra adva...
Hung-Min Sun, Shiuh-Pyng Shieh