Sciweavers

1351 search results - page 176 / 271
» Learning from compressed observations
Sort
View
WSOM
2009
Springer
15 years 11 months ago
Approaching the Time Dependent Cocktail Party Problem with Online Sparse Coding Neural Gas
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
Kai Labusch, Erhardt Barth, Thomas Martinetz
PKDD
2010
Springer
313views Data Mining» more  PKDD 2010»
15 years 2 months ago
Topic Modeling for Personalized Recommendation of Volatile Items
One of the major strengths of probabilistic topic modeling is the ability to reveal hidden relations via the analysis of co-occurrence patterns on dyadic observations, such as docu...
Maks Ovsjanikov, Ye Chen
ICASSP
2008
IEEE
15 years 11 months ago
Bayesian update of dialogue state for robust dialogue systems
This paper presents a new framework for accumulating beliefs in spoken dialogue systems. The technique is based on updating a Bayesian Network that represents the underlying state...
Blaise Thomson, Jost Schatzmann, Steve Young
ICCV
2003
IEEE
15 years 9 months ago
Tracking Across Multiple Cameras With Disjoint Views
Conventional tracking approaches assume proximity in space, time and appearance of objects in successive observations. However, observations of objects are often widely separated ...
Omar Javed, Zeeshan Rasheed, Khurram Shafique, Mub...
WETICE
2000
IEEE
15 years 8 months ago
CVE Technology Development Based on Real World Application and User Needs
This paper argues that the development of Collaborative Virtual Environment (CVE) technology must be guided by application and end user needs. A collaboration is described between ...
Daphne Economou, William L. Mitchell, Steve Pettif...