4377 search results - page 90 / 876 » Mass problems and randomness |
166
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
—We present a meta-learning framework for the design of potential functions for Conditional Random Fields. The design of both node potential and edge potential is formulated as a...
171
click to vote
JSAC
2008
15 years 5 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
161
click to vote
OL
2010
15 years 3 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
177
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
141
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...