337 search results - page 36 / 68 » Computational complexity of weighted splitting schemes on pa... |
135
Voted
PDCAT
2004
Springer
15 years 11 months ago
2004
Springer
Today’s cryptanalysis on symmetric key cryptography is encouraging the use of larger key sizes and complex algorithms to achieve an unbreakable state. However, this leads an inc...
133
Voted
ICDCS
2008
IEEE
16 years 17 days ago
2008
IEEE
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Recently, replication based approaches were proposed to furth...
153
click to vote
VLDB
1992
ACM
15 years 10 months ago
1992
ACM
In this paper, we discuss issues involving temporal data fragmentation, temporal query processing, and query optimization in multiprocessor database machines. We propose parallel ...
147
click to vote
CLUSTER
2008
IEEE
16 years 18 days ago
2008
IEEE
—User-level communication allows an application process to access the network interface directly. Bypassing the kernel requires that a user process accesses the network interface...
129
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...