Sciweavers

46 search results - page 5 / 10
» A game-theoretic procedure for learning hierarchically struc...
Sort
View
ECAI
2004
Springer
15 years 5 months ago
Learning Complex and Sparse Events in Long Sequences
The Hierarchical Hidden Markov Model (HHMM) is a well formalized tool suitable to model complex patterns in long temporal or spatial sequences. Even if effective algorithms are ava...
Marco Botta, Ugo Galassi, Attilio Giordana
LWA
2007
15 years 1 months ago
Position Paper: Ontology Learning from Folksonomies
The emergence of collaborative tagging systems with their underlying flat and uncontrolled resource organization paradigm has led to a large number of research activities focussi...
Dominik Benz, Andreas Hotho
ICTAI
2010
IEEE
14 years 9 months ago
Unsupervised Greedy Learning of Finite Mixture Models
This work deals with a new technique for the estimation of the parameters and number of components in a finite mixture model. The learning procedure is performed by means of a expe...
Nicola Greggio, Alexandre Bernardino, Cecilia Lasc...
JSA
2000
103views more  JSA 2000»
14 years 11 months ago
Testing and built-in self-test - A survey
As the density of VLSI circuits increases it becomes attractive to integrate dedicated test logic on a chip. This Built-in Self-Test (BIST) approach not only offers economic benef...
Andreas Steininger
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 3 days ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...