29908 search results - page 407 / 5982 » On the Complexity of |
152
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
159
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
Coarse-grained approaches to customization allow the user to enable or disable groups of features at once, rather than individual features. While this may reduce the complexity of...
174
click to vote
STOC
2002
ACM
16 years 7 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...
252
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...
155
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...