2080 search results - page 21 / 416 » Measuring empirical computational complexity |
APGV
2007
ACM
14 years 1 months ago
2007
ACM
This paper describes an experiment investigating for the first time, the perceptual tolerance of inconsistent projections when rotated billboards are transformed and included in a...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
IV
2009
IEEE
14 years 4 months ago
2009
IEEE
Aesthetics is an unsolved problem of information visualization, because there is no satisfactory understanding of what constitutes aesthetic effect. This survey paper gives an ove...
DBA
2004
13 years 11 months ago
2004
Clustering has become an increasingly important task in modern application domains. Mostly, the data are originally collected at different sites. In order to extract information f...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...