3607 search results - page 516 / 722 » Learning with structured sparsity |
141
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
133
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Discriminative training of graphical models can be expensive if the variables have large cardinality, even if the graphical structure is tractable. In such cases, pseudolikelihood...
140
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
111
click to vote
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
134
click to vote
SIGSOFT
2001
ACM
16 years 5 months ago
2001
ACM
Most quality and software process improvement frameworks emphasize written (i.e. formal) documentation to convey recommended work practices. However, there is considerable skeptic...