Sciweavers

7796 search results - page 1150 / 1560
» On Generalized Schur Numbers
Sort
View
FSTTCS
2003
Springer
16 years 28 days ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
ISCA
2010
IEEE
214views Hardware» more  ISCA 2010»
16 years 24 days ago
Re-architecting DRAM memory systems with monolithically integrated silicon photonics
The performance of future manycore processors will only scale with the number of integrated cores if there is a corresponding increase in memory bandwidth. Projected scaling of el...
Scott Beamer, Chen Sun, Yong-Jin Kwon, Ajay Joshi,...
COMPGEOM
2010
ACM
16 years 24 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
TAMC
2010
Springer
16 years 23 days ago
Streaming Algorithms for Some Problems in Log-Space
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
Ajesh Babu, Nutan Limaye, Girish Varma
ISESE
2002
IEEE
16 years 19 days ago
The Appropriateness of Gutman's Means-End Chain Model in Software Evaluation
The primary objective of this paper was to examine the extent to which Gutman’s Means-End Chain Model can be used to describe the influences given to the choice of characteristi...
Bernard Wong
« Prev « First page 1150 / 1560 Last » Next »