2314 search results - page 162 / 463 » Minimal Partitions of a Graph |
181
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
171
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
170
click to vote
DCOSS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
174
click to vote
CCCG
2009
15 years 7 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
183
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...