Sciweavers

36320 search results - page 761 / 7264
» From Code to Models
Sort
View
SOSP
1997
ACM
15 years 8 months ago
A Decentralized Model for Information Flow Control
This paper presents a new model for controlling information flow in systems with mutual distrust and decentralized authority. The model allows users to share information with dis...
Andrew C. Myers, Barbara Liskov
ICALP
2005
Springer
16 years 29 days ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
IEEEPACT
2002
IEEE
16 years 11 days ago
An Evaluation of Data-Parallel Compiler Support for Line-Sweep Applications
Data parallel compilers have long aimed to equal the performance of carefully hand-optimized parallel codes. For tightly-coupled applications based on line sweeps, this goal has b...
Daniel G. Chavarría-Miranda, John M. Mellor...
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat
INFSOF
2002
153views more  INFSOF 2002»
15 years 7 months ago
Analyzing cloning evolution in the Linux kernel
Identifying code duplication in large multi-platform software systems is a challenging problem. This is due to a variety of reasons including the presence of high-level programmin...
Giuliano Antoniol, Umberto Villano, Ettore Merlo, ...