Sciweavers

5138 search results - page 501 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
NIPS
2007
15 years 8 months ago
Cooled and Relaxed Survey Propagation for MRFs
We describe a new algorithm, Relaxed Survey Propagation (RSP), for finding MAP configurations in Markov random fields. We compare its performance with state-of-the-art algorith...
Hai Leong Chieu, Wee Sun Lee, Yee Whye Teh
IVEVA
2004
15 years 8 months ago
Groups and Crowds with behaviors specified in the environment
Abstract. In this paper we describe a system where behavior of characters and groups of characters are determined by assigning attributes to groups and individuals hierarchically a...
Isaac Rudomín, Fernando Perez, Erik Mill&aa...
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 7 months ago
Efficient Sketches for the Set Query Problem
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
Eric Price
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 7 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 7 months ago
Approximating Multi-Criteria Max-TSP
Abstract. We present randomized approximation algorithms for multicriteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1 k - for a...
Markus Bläser, Bodo Manthey, Oliver Putz