Sciweavers

2214 search results - page 156 / 443
» complexity 2004
Sort
View
CORR
2004
Springer
90views Education» more  CORR 2004»
13 years 10 months ago
Non-computable Julia sets
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 ...
Mark Braverman, Michael Yampolsky
ISMIR
2004
Springer
159views Music» more  ISMIR 2004»
14 years 3 months ago
Towards an Efficient Algorithm for Automatic Score-to-Audio Synchronization
In the last few years, several algorithms for the automatic alignment of audio and score data corresponding to the same piece of music have been proposed. Among the major drawback...
Meinard Müller, Frank Kurth, Tido Röder
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 10 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
IFIP
2004
Springer
14 years 3 months ago
Safety assessment with AltaRica
: AIRBUS and ONERA used the AltaRica formal language and associated tools to perform safety assessments. Lessons learnt during the study of an electrical and hydraulic system are p...
Pierre Bieber, Christian Bougnol, Charles Castel, ...
ACE
2004
222views Education» more  ACE 2004»
13 years 11 months ago
Learning about Software Development - Should Programming Always Come First?
The issues surrounding curriculum design of many Computer Science and Software Engineering degree programs1 are many and complex. In particular, the question of whether prior prog...
Margaret Hamilton, Liz Haywood