1242 search results - page 110 / 249 » A Computational Complexity Theory in Membrane Computing |
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
RSCTC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
AAAI
1994
14 years 11 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
CGF
2000
14 years 9 months ago
2000
: Having evolved from volume visualisation, volume graphics is emerging as an important sub-field of computer graphics. This paper focuses on a fundamental aspect of volume graphic...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...