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 intended set of visual objects from a continuous stream of pen strokes. Existing pen-based systems either avoid these issue
โฆ LIBER โฆ
[ACM Press ACM SIGGRAPH 2007 courses - San Diego, California (2007.08.05-2007.08.09)] ACM SIGGRAPH 2007 courses on - SIGGRAPH '07 - Hierarchical parsing and recognition of hand-sketched diagrams
โ Scribed by Kara, Levent Burak; Stahovich, Thomas F.
- Book ID
- 121434638
- Publisher
- ACM Press
- Year
- 2007
- Weight
- 311 KB
- Category
- Article
- ISBN
- 1450318231
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
[ACM Press ACM SIGGRAPH 2007 courses - S
โ
Kara, Levent Burak; Stahovich, Thomas F.
๐
Article
๐
2007
๐
ACM Press
โ 311 KB
[ACM Press ACM SIGGRAPH 2007 courses - S
โ
Adler, Aaron; Davis, Randall
๐
Article
๐
2007
๐
ACM Press
โ 356 KB
[ACM Press ACM SIGGRAPH 2007 courses - S
โ
Pighin, Fred; Lewis, J. P.
๐
Article
๐
2007
๐
ACM Press
โ 629 KB
[ACM Press ACM SIGGRAPH 2007 educators p
โ
Adamo-Villani, Nicoletta; Wright, Kelly
๐
Article
๐
2007
๐
ACM Press
โ 218 KB
[ACM Press ACM SIGGRAPH 2007 papers - Sa
โ
Guenter, Brian
๐
Article
๐
2007
๐
ACM Press
โ 725 KB
[ACM Press ACM SIGGRAPH 2007 papers - Sa
โ
Guenter, Brian
๐
Article
๐
2007
๐
ACM Press
โ 725 KB
Functions with densely interconnected expression graphs, which arise in computer graphics applications such as dynamics, spacetime optimization, and PRT, can be difficult to efficiently differentiate using existing symbolic or automatic differentiation techniques. Our new algorithm, D\*, computes ef