7 search results - page 1 / 2 » Clustering Partially Observed Graphs via Convex Optimization |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
IAT
2005
IEEE
13 years 10 months ago
2005
IEEE
Partially observable Markov decision process (POMDP) is commonly used to model a stochastic environment with unobservable states for supporting optimal decision making. Computing ...
PROCEDIA
2010
13 years 3 months ago
2010
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...