Sciweavers

2088 search results - page 360 / 418
» The Probabilistic Method
Sort
View
NIPS
2007
13 years 11 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
RIAO
2007
13 years 11 months ago
Discriminative Fields for Modeling Semantic Concepts in Video
According to some current thinking, a very large number of semantic concepts could provide researcher a novel way to characterize video and be utilized for video retrieval and und...
Ming-yu Chen, Alexander G. Hauptmann
AIPS
2006
13 years 11 months ago
Reusing and Building a Policy Library
Policy Reuse is a method to improve reinforcement learning with the ability to solve multiple tasks by building upon past problem solving experience, as accumulated in a Policy Li...
Fernando Fernández, Manuela M. Veloso
NIPS
2004
13 years 11 months ago
Spike Sorting: Bayesian Clustering of Non-Stationary Data
Spike sorting involves clustering spike trains recorded by a microelectrode according to the source neuron. It is a complicated problem, which requires a lot of human labor, partl...
Aharon Bar-Hillel, Adam Spiro, Eran Stark
BMVC
2000
13 years 11 months ago
A Statistical Geometric Framework for Reconstruction of Scene Models
This paper addresses the problem of reconstructing surface models of indoor scenes from sparse 3D scene structure captured from N camera views. Sparse 3D measurements of real scen...
Anastasios Manessis, Adrian Hilton, Philip F. McLa...