Sciweavers

213 search results - page 6 / 43
» Counting Independent Sets Using the Bethe Approximation
Sort
View
91
Voted
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 4 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
14 years 11 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane
82
Voted
DAGSTUHL
2004
14 years 11 months ago
Information-Based Nonlinear Approximation: An Average Case Setting
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
Leszek Plaskota
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
15 years 9 months ago
Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
Amol Deshpande, Minos N. Garofalakis, Rajeev Rasto...
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
15 years 10 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad