178
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Random projection methods give distributions over k
209
Voted
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
197
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
173
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...