205 search results - page 34 / 41 » Complexity of Polynomial Multiplication over Finite Fields |
JMLR
2006
13 years 8 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
TAPSOFT
1991
Springer
13 years 12 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Abstract. We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or be...
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...