142 search results - page 28 / 29 » On the Independent Domination Number of Random Regular Graph... |
SPAA
1996
ACM
13 years 10 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
CTRSA
2009
Springer
13 years 9 months ago
2009
Springer
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
EUROCRYPT
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particul...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
CIKM
2008
Springer
13 years 7 months ago
2008
Springer
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...