Sciweavers

6404 search results - page 1279 / 1281
» Blocks
Sort
View
ISCA
2012
IEEE
333views Hardware» more  ISCA 2012»
11 years 10 months ago
Reducing memory reference energy with opportunistic virtual caching
Most modern cores perform a highly-associative translation look aside buffer (TLB) lookup on every memory access. These designs often hide the TLB lookup latency by overlapping it...
Arkaprava Basu, Mark D. Hill, Michael M. Swift
PKC
2012
Springer
234views Cryptology» more  PKC 2012»
11 years 10 months ago
Ring-LWE in Polynomial Rings
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
Léo Ducas, Alain Durmus
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
CCS
2009
ACM
14 years 8 months ago
Towards complete node enumeration in a peer-to-peer botnet
Modern advanced botnets may employ a decentralized peer-to-peer overlay network to bootstrap and maintain their command and control channels, making them more resilient to traditi...
Brent ByungHoon Kang, Eric Chan-Tin, Christopher P...
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
« Prev « First page 1279 / 1281 Last » Next »