209 search results - page 31 / 42 » The Computational Complexity of Weak Saddles |
GG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
ENTCS
2010
13 years 7 months ago
2010
The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which ...
ACL
2010
13 years 5 months ago
2010
This paper describes a series of experiments to test the hypothesis that the parallel application of multiple NLP tools and the integration of their results improves the correctne...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
We present a novel technique, termed attached shadow coding, for estimating surface normals from shadows when the reflectance and lighting conditions are unknown. Our key idea is ...