Sciweavers

903 search results - page 33 / 181
» Non-well-founded trees in categories
Sort
View
SIGPLAN
2002
14 years 11 months ago
Pattern-matching and rewriting rules for group indexed data structures
In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-ba...
Jean-Louis Giavitto, Olivier Michel, Julien Cohen
MIR
2010
ACM
179views Multimedia» more  MIR 2010»
14 years 10 months ago
Speculation on the generality of the backward stepwise view of PCA
A novel backwards viewpoint of Principal Component Analysis is proposed. In a wide variety of cases, that fall into the area of Object Oriented Data Analysis, this viewpoint is se...
J. S. Marron, Sungkyu Jung, Ian L. Dryden
CVPR
2008
IEEE
15 years 6 months ago
Action recognition with motion-appearance vocabulary forest
In this paper we propose an approach for action recognition based on a vocabulary forest of local motionappearance features. Large numbers of features with associated motion vecto...
Krystian Mikolajczyk, Hirofumi Uemura
ECIR
2006
Springer
15 years 1 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
ENTCS
2007
123views more  ENTCS 2007»
14 years 11 months ago
Labelled Markov Processes as Generalised Stochastic Relations
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
Michael W. Mislove, Dusko Pavlovic, James Worrell