1221 search results - page 75 / 245 » A Comparison of Two Programming Models for Pervasive Computi... |
125
Voted
ICSEA
2007
IEEE
15 years 9 months ago
2007
IEEE
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...
131
click to vote
AIEDAM
2008
15 years 3 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
165
click to vote
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
Phylogenetic hidden Markov models (phylo-HMMs) have recently been proposed as a means for addressing a multispecies version of the ab initio gene prediction problem. These models ...
121
click to vote
SPAA
1996
ACM
15 years 7 months ago
1996
ACM
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, alth...
115
Voted
TCC
2009
Springer
16 years 3 months ago
2009
Springer
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfus...