6315 search results - page 189 / 1263 » Approximating Solution Structure |
201
click to vote
DAGM
2008
Springer
15 years 8 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
222
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
150
click to vote
EACL
2006
ACL Anthology
15 years 8 months ago
2006
ACL Anthology
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
187
click to vote
PVLDB
2010
15 years 4 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
194
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we consider the problem of manifold approximation with affine subspaces. Our objective is to discover a set of low dimensional affine subspaces that represents ma...