263 search results - page 48 / 53 » Minimum Entropy Coloring |
115
click to vote
TRECVID
2007
15 years 25 days ago
2007
In this paper we describe our experiments for the high level features extraction task of TRECVid 2007. Our approach is different than previous submissions in that we have impleme...
106
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
JCT
2008
14 years 11 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
109
click to vote
TSP
2008
14 years 11 months ago
2008
We consider the problem of estimating the covariance matrix of an observation vector, using heterogeneous training samples, i.e., samples whose covariance matrices are not exactly ...
TSP
2008
14 years 11 months ago
2008
Abstract--We consider the adaptive detection of a signal of interest embedded in colored noise, when the environment is nonhomogeneous, i.e., when the training samples used for ada...