2354 search results - page 60 / 471 » Randomness, Stochasticity and Approximations |
ANOR
2004
13 years 7 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
SIAMCOMP
1998
13 years 7 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
FPL
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents a hardware architecture for non-uniform random number generation, which allows the generator's distribution to be modified at run-time without reconfigura...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
TIP
2008
13 years 7 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...