1369 search results - page 116 / 274 » Lattice computations for random numbers |
NIPS
2008
13 years 10 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
NAACL
2010
13 years 7 months ago
2010
In this paper, we focus on a recent Web trend called microblogging, and in particular a site called Twitter. The content of such a site is an extraordinarily large number of small...
SAC
2011
ACM
13 years 4 months ago
2011
ACM
We propose a more efficient version of the slice sampler for Dirichlet process mixture models described by Walker (2007). This sampler allows the fitting of infinite mixture mod...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...