1591 search results - page 2 / 319 » Random lifts of graphs |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
OOPSLA
2005
Springer
13 years 10 months ago
2005
Springer
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
AAAI
2006
13 years 6 months ago
2006
It is often convenient to represent probabilistic models in a first-order fashion, using logical atoms such as
AAAI
2008
13 years 7 months ago
2008
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...