1431 search results - page 96 / 287 » The complexity of random ordered structures |
111
click to vote
ICDT
1999
ACM
15 years 7 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
110
click to vote
CRYPTO
2005
Springer
15 years 8 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
120
click to vote
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
High performance computing is critical for financial markets where analysts seek to accelerate complex optimizations such as pricing engines to maintain a competitive edge. In th...
141
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. Our aim is to study the performance as perceived by users in a dynamic setting...
122
click to vote
EURONGI
2006
Springer
15 years 6 months ago
2006
Springer
We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. In general, our aim is to study the performance as perceived by users in a dynamic...