Sciweavers

495 search results - page 41 / 99
» Sparse representation algorithms based on mean-field approxi...
Sort
View
NIPS
2004
14 years 11 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
GECCO
2009
Springer
15 years 4 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
CAD
1998
Springer
14 years 9 months ago
Approximation of developable surfaces with cone spline surfaces
Developable surfaces are modelled with pieces of right circular cones. These cone spline surfaces are well-suited for applications: They possess degree two parametric and implicit...
Stefan Leopoldseder, Helmut Pottmann
PAMI
2007
138views more  PAMI 2007»
14 years 9 months ago
A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation
—We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities cause...
Pierre Bayerl, Heiko Neumann
DATAMINE
2006
176views more  DATAMINE 2006»
14 years 10 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...