Sciweavers

1871 search results - page 235 / 375
» The Ephemeral Pairing Problem
Sort
View
TSP
2010
15 years 1 months ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 1 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 10 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
ICCV
2011
IEEE
14 years 6 months ago
Learning Cross-modality Similarity for Multinomial Data
Many applications involve multiple-modalities such as text and images that describe the problem of interest. In order to leverage the information present in all the modalities, on...
Yangqing Jia, Mathieu Salzmann, Trevor Darrell
CVPR
2012
IEEE
13 years 9 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould