4781 search results - page 413 / 957 » Complexity at large |
162
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
148
Voted
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
As robots become more complex by incorporating dynamic stability or greater mechanical degrees of freedom, the difficulty of developing control algorithms directly on the robot in...
156
click to vote
IDEAL
2004
Springer
15 years 10 months ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...
145
click to vote
ISMIR
2004
Springer
15 years 10 months ago
2004
Springer
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...
125
click to vote
OOPSLA
2004
Springer
15 years 10 months ago
2004
Springer
Effective and affordable business process integration is a key concern in the finance industry. A large German joint-use centre, supplying services to 237 individual savings banks...