4332 search results - page 475 / 867 » A Probabilistic Identification Result |
138
click to vote
DCG
2000
15 years 6 months ago
2000
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
163
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Data mining services require accurate input data for their results to be meaningful, but privacy concerns may influence users to provide spurious information. We investigate here,...
187
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the problem of training discriminative structured output predictors, such as conditional random fields (CRFs) and structured support vector machines (SSVMs)....
174
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we describe recent progress in i-vector based speaker verification. The use of universal background models (UBM) with full-covariance matrices is suggested and tho...
187
click to vote
EMMCVPR
2011
Springer
14 years 6 months ago
2011
Springer
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...