2354 search results - page 268 / 471 » Randomness, Stochasticity and Approximations |
164
Voted
TCS
2002
15 years 5 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
151
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
165
Voted
APPROX
2009
Springer
16 years 22 days ago
2009
Springer
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...
157
click to vote
APPROX
2008
Springer
15 years 8 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...
193
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...