2366 search results - page 198 / 474 » Mapping time |
IJCAI
1989
15 years 5 months ago
1989
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou sand time-tokens in demanding applications su...
158
Voted
NN
2008
Springer
15 years 2 months ago
2008
Springer
We propose a novel similarity measure, called the correntropy coefficient, sensitive to higher order moments of the signal statistics based on a similarity function called the cro...
116
click to vote
GD
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
142
Voted
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a kernel-based recursive least-squares (KRLS) algorithm on a fixed memory budget, capable of recursively learning a nonlinear mapping and tracking changes over time. I...
142
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...