42230 search results - page 8270 / 8446 » Algorithms and Complexity Results for |
191
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
158
click to vote
UIST
2004
ACM
15 years 12 months ago
2004
ACM
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
213
click to vote
VRST
2004
ACM
15 years 12 months ago
2004
ACM
In this paper, we propose a new method for simulating reactive motions for running or walking human figures. The goal is to generate realistic animations of how humans compensate...
299
click to vote
ADS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. If we wish to implement dialogue systems which express emotion, dialogue corpora annotated for emotion would be a valuable resource. In order to develop such corpora we r...
173
click to vote
ASIAN
2004
Springer
15 years 12 months ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...