2080 search results - page 48 / 416 » Measuring empirical computational complexity |
STOC
2005
ACM
14 years 3 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Usually, performance of classifiers is evaluated on real-world problems that mainly belong to public repositories. However, we ignore the inherent properties of these data and how...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
This paper studies the problem of modeling complex domains of actions and change within highlevel action description languages. We investigate two main issues of concern: (a) can ...
PRL
2008
13 years 9 months ago
2008
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
GRAMMARS
1998
13 years 9 months ago
1998
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...