28888 search results - page 406 / 5778 » Computability and complexity in analysis |
153
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
147
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
135
Voted
PPSN
2004
Springer
16 years 5 days ago
2004
Springer
A radius–based separation of selection and recombination spheres in diffusion model EAs is introduced, enabling a new taxonomy, oriented towards information flow analysis. It a...
162
click to vote
DSN
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper deals with the performance analysis of a system modeled by a queue. If we are interested in occupation problems and if we look at the transient phase, then it makes sen...
159
click to vote
C3S2E
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we define four operations on musical rhythms that preserve a property called maximal evenness. The operations we describe are shadow, complementation, concatenation,...