5138 search results - page 177 / 1028 » Randomized Algorithms for 3-SAT |
135
click to vote
JAIR
2007
15 years 6 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
162
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
208
click to vote
ARC
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Financial applications are one of many fields where a multivariate Gaussian random number generator plays a key role in performing computationally extensive simulations. ...
167
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
141
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...