5138 search results - page 174 / 1028 » Randomized Algorithms for 3-SAT |
207
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
233
click to vote
AAAI
2011
14 years 6 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
140
Voted
IPL
2008
15 years 6 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
154
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
The two major Markov Random Fields (MRF) based algorithms for image segmentation are the Simulated Annealing (SA) and Iterated Conditional Modes (ICM). In practice, compared to the...
142
click to vote
ISAAC
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...