6045 search results - page 276 / 1209 » Computable Linearizations of Well-partial-orderings |
179
click to vote
SIGGRAPH
1996
ACM
15 years 11 months ago
1996
ACM
Current linear-time simulation methods for articulated figures are based exclusively on reduced-coordinate formulations. This paper describes a general, non-iterative linear-time ...
162
click to vote
STOC
1990
ACM
15 years 11 months ago
1990
ACM
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...
209
click to vote
CGF
2007
15 years 7 months ago
2007
Represented in a Morphable Model, 3D faces follow curved trajectories in face space as they age. We present a novel algorithm that computes the individual aging trajectories for g...
192
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
170
click to vote
CGA
2006
15 years 7 months ago
2006
Interactive narrative systems are storytelling systems in which the user can influence the content or ordering of story world events. Conceptually, an interactive narrative can be...