1369 search results - page 23 / 274 » Lattice computations for random numbers |
HPCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We address computational issues relevant to the study of disordered quantum mechanical systems at very low temperatures. As an example we consider the disordered BoseHubbard model...
DCC
2011
IEEE
13 years 3 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
ICASSP
2011
IEEE
13 years 16 days ago
2011
IEEE
In this paper we model and simulate a biological system describing the evolution of cancer stem cells into tumors. Starting from some basic hypotheses about the behavior of these ...
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
2010
Eurographics
Many useful algorithms for processing images and geometry fall under the general framework of high-dimensional Gaussian filtering. This family of algorithms includes bilateral ...