1425 search results - page 7 / 285 » Beyond Dependency Graphs |
141
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
127
Voted
SIGSOFT
1994
ACM
15 years 6 months ago
1994
ACM
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
111
Voted
NIPS
2003
15 years 4 months ago
2003
We formulate linear dimensionality reduction as a semi-parametric estimation problem, enabling us to study its asymptotic behavior. We generalize the problem beyond additive Gauss...
124
Voted
SSIRI
2010
15 years 29 days ago
2010
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
146
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...