2157 search results - page 60 / 432 » Optimal Fast Hashing |
233
click to vote
ASPLOS
2011
ACM
14 years 7 months ago
2011
ACM
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
128
click to vote
CCS
2005
ACM
15 years 9 months ago
2005
ACM
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
148
click to vote
SEMWEB
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of SPARQL query optimization on top of distributed hash tables. Existing works on SPARQL query processing in such environments have never been implemented in a...
134
click to vote
AIPS
2008
15 years 6 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
145
click to vote
BNCOD
1997
15 years 5 months ago
1997
Abstract. In this paper we present two improvements to the partitioning process: 1) A new dynamic bu er management strategy is employed to increase the average block size of I/O-tr...