5138 search results - page 128 / 1028 » Randomized Algorithms for 3-SAT |
107
click to vote
JSAT
2006
15 years 1 months ago
2006
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
103
click to vote
ICIP
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper proposes a fast blotch detection algorithm based on a Markov Random Field (MRF) model with less computational load and with lower false alarm rate than the existing MRF...
108
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
108
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
127
click to vote
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...