Sciweavers

2088 search results - page 360 / 418
» The Probabilistic Method
Sort
View
81
Voted
NIPS
2007
15 years 2 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
15 years 2 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
75
Voted
AIPS
2006
15 years 2 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
106
Voted
NIPS
2004
15 years 2 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
99
Voted
BMVC
2000
15 years 2 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...