2957 search results - page 228 / 592 » The Complexity of Polynomial-Time Approximation |
202
click to vote
DAGM
2008
Springer
15 years 8 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
170
click to vote
SIGPRO
2011
15 years 1 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
275
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
163
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
151
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...