1369 search results - page 155 / 274 » Lattice computations for random numbers |
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
GRAPHICSINTERFACE
2001
13 years 10 months ago
2001
Weathering phenomena represent a topic of growing interest in computer graphics, and corrosion reactions are of great importance since they affect a large number of different fiel...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
JODL
2006
13 years 9 months ago
2006
Abstract Scalable storage architectures enable digital libraries and archives for the addition or removal of storage devices to increase storage capacity and bandwidth or retire ol...
ICASSP
2011
IEEE
13 years 27 days ago
2011
IEEE
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...