Sciweavers

5639 search results - page 356 / 1128
» Timed Abstract Non-interference
Sort
View
120
Voted
RECOMB
2009
Springer
15 years 11 months ago
Rearrangement Models and Single-Cut Operations
Abstract. There have been many widely used genome rearrangement models, such as reversals, HannenhalliPevzner, and double-cut and join. Though each one can be precisely defined, t...
Paul Medvedev, Jens Stoye
ICC
2009
IEEE
159views Communications» more  ICC 2009»
15 years 11 months ago
An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo ...
VL
2009
IEEE
126views Visual Languages» more  VL 2009»
15 years 11 months ago
A graphical approach for modeling time-dependent behavior of DSLs
Domain specific languages (DSLs) play a cornerstone Model-Driven Software Development. The abstract syntax of a DSL is usually defined by a metamodel, while inplace model transf...
José Eduardo Rivera, Francisco Durán...
NTMS
2009
IEEE
15 years 10 months ago
A Comprehensive Reference Architecture for Trustworthy Long-Term Archiving of Sensitive Data
Abstract—It is well known that the suitability of many cryptographic algorithms decreases with time. Hence, it is a challenging task to maintain the integrity, authenticity, con...
Detlef Hühnlein, Ulrike Korte, Lucie Langer, ...
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
15 years 10 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...