84
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
73
Voted
DAGM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. An information theoretic framework for grouping observations is proposed. The entropy change incurred by new observations is analyzed using the Kalman filter update equa...
88
Voted
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
139
Voted
Publication
We present an online learning approach for robustly combining unreliable
observations from a pedestrian detector to estimate the rough 3D scene geometry
from video sequences of a...
127
Voted
Publication
One of the principal bottlenecks in applying learning techniques to classification problems is the large amount of labeled training data required. Especially for images and video, ...