Sciweavers

726 search results - page 100 / 146
» Recent advances in computational models of natural argument
Sort
View
ICCV
2001
IEEE
16 years 8 months ago
BraMBLe: A Bayesian Multiple-Blob Tracker
Blob trackers have become increasingly powerful in recent years largely due to the adoption of statistical appearance models which allow effective background subtraction and robus...
Michael Isard, John MacCormick
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 6 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
ASPLOS
2010
ACM
16 years 19 days ago
Cortical architectures on a GPGPU
As the number of devices available per chip continues to increase, the computational potential of future computer architectures grows likewise. While this is a clear benefit for f...
Andrew Nere, Mikko Lipasti
ACL
2010
15 years 4 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
CVPR
2008
IEEE
16 years 8 months ago
Automatic non-rigid registration of 3D dynamic data for facial expression synthesis and transfer
Automatic non-rigid registration of 3D time-varying data is fundamental in many vision and graphics applications such as facial expression analysis, synthesis, and recognition. De...
Sen Wang, Xianfeng David Gu, Hong Qin