2430 search results - page 303 / 486 » Computing Tutte Polynomials |
132
Voted
VISSYM
2003
15 years 5 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
128
Voted
AAAI
1994
15 years 5 months ago
1994
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
117
Voted
AAAI
1996
15 years 5 months ago
1996
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
164
Voted
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Image moments have been widely used for designing robust shape descriptors that are invariant to rigid transformations. In this work, we address the problem of estimating non-rigid...
136
Voted
AAECC
2010
Springer
15 years 3 months ago
2010
Springer
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...