2079 search results - page 102 / 416 » Universality of random graphs |
149
click to vote
SODA
1993
ACM
15 years 5 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
132
click to vote
ACL
2009
15 years 2 months ago
2009
Most approaches to topic modeling assume an independence between documents that is frequently violated. We present an topic model that makes use of one or more user-specified grap...
ATS
2009
IEEE
15 years 11 months ago
2009
IEEE
As diagnostic testing for memory devices increasingly gains in importance, companies are looking for flexible, cost effective methods to perform diagnostics on their failing devi...
130
click to vote
ENTCS
2007
15 years 4 months ago
2007
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
157
click to vote
FSE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...