Sciweavers

770 search results - page 27 / 154
» Latent Class Models for Algorithm Portfolio Methods
Sort
View
SIGIR
2005
ACM
15 years 3 months ago
Relation between PLSA and NMF and implications
Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as docum...
Éric Gaussier, Cyril Goutte
MLMI
2004
Springer
15 years 3 months ago
Shallow Dialogue Processing Using Machine Learning Algorithms (or Not)
This paper presents a shallow dialogue analysis model, aimed at human-human dialogues in the context of staff or business meetings. Four components of the model are defined, and ...
Andrei Popescu-Belis, Alexander Clark, Maria Georg...
CVPR
2005
IEEE
15 years 3 months ago
A Discriminative Framework for Modelling Object Classes
Here we explore a discriminative learning method on underlying generative models for the purpose of discriminating between object categories. Visual recognition algorithms learn m...
Alex Holub, Pietro Perona
DEDS
2006
111views more  DEDS 2006»
14 years 9 months ago
Model Checking of Time Petri Nets Using the State Class Timed Automaton
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Didier Lime, Olivier H. Roux
ATAL
2008
Springer
14 years 11 months ago
Multi-robot Markov random fields
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...
Jesse Butterfield, Odest Chadwicke Jenkins, Brian ...