Sciweavers

1802 search results - page 173 / 361
» Sparse Computations with PEI
Sort
View
140
Voted
JVCA
2008
112views more  JVCA 2008»
15 years 4 months ago
Constraint-based motion synthesis for deformable models
We present a fast goal-directed motion synthesis technique that integrates sample-based planning methods with constraint-based dynamics simulation using a finite element formulati...
William Moss, Ming C. Lin, Dinesh Manocha
ACL
2009
15 years 2 months ago
Generalizing over Lexical Features: Selectional Preferences for Semantic Role Classification
This paper explores methods to alleviate the effect of lexical sparseness in the classification of verbal arguments. We show how automatically generated selectional preferences ar...
Beñat Zapirain, Eneko Agirre, Lluís ...
ICIP
2009
IEEE
15 years 2 months ago
Structured pursuits for geometric super-resolution
Super-resolution image zooming is possible when the image has some geometric regularity. We introduce a general class of non-linear inverse estimators, which combines linear estima...
Stéphane Mallat, Guoshen Yu
CAP
2010
14 years 11 months ago
A high-performance algorithm for calculating cyclotomic polynomials
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
Andrew Arnold, Michael B. Monagan
ICCV
2011
IEEE
14 years 4 months ago
In Defense of Soft-assignment Coding
In object recognition, soft-assignment coding enjoys computational efficiency and conceptual simplicity. However, its classification performance is inferior to the newly develop...
Lingqiao Liu, Lei Wang, Xinwang Liu