5595 search results - page 752 / 1119 » Approximation Algorithms for Clustering Problems |
206
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...
162
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
154
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
195
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
186
click to vote
ACL
2009
15 years 4 months ago
2009
Stochastic gradient descent (SGD) uses approximate gradients estimated from subsets of the training data and updates the parameters in an online fashion. This learning framework i...