2273 search results - page 75 / 455 » On the Expressiveness and Complexity of ATL |
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
ADBIS
2006
Springer
15 years 3 months ago
2006
Springer
XML is suitable for structuring complex data coming from different sources and supported by heterogeneous formats. It allows a flexible formalism capable to represent and store d...
NPAR
2004
ACM
15 years 3 months ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
FGR
2002
IEEE
15 years 2 months ago
2002
IEEE
Previous work suggests that Gabor-wavelet-based methods can achieve high sensitivity and specificity for emotionspecified expressions (e.g., happy, sad) and single action units ...
102
click to vote
DAC
1999
ACM
15 years 2 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...