Sciweavers

263 search results - page 17 / 53
» Minimum Entropy Coloring
Sort
View
COMBINATORICA
2004
51views more  COMBINATORICA 2004»
14 years 11 months ago
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares
It is proved in this paper that every bipartite graphic sequence with the minimum degree 2 has a realization that admits a nowhere-zero 4-flow. This result implies a conjecture ...
Rong Luo, Wenan Zang, Cun-Quan Zhang
JGT
2007
69views more  JGT 2007»
14 years 11 months ago
The size of minimum 3-trees
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is a heterochromatic triple and the hypergraph has the minimum possible number of ...
Jorge L. Arocha, Joaquín Tey
ICIP
2000
IEEE
16 years 1 months ago
Image Registration with Minimum Spanning Tree Algorithm
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphreprese...
Bing Ma, Alfred O. Hero III, John D. Gorman, Olivi...
CORR
2010
Springer
129views Education» more  CORR 2010»
14 years 11 months ago
Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error
Consider the minimum mean-square error (MMSE) of estimating an arbitrary random variable from its observation contaminated by Gaussian noise. The MMSE can be regarded as a function...
Dongning Guo, Yihong Wu, Shlomo Shamai, Sergio Ver...
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 6 days ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...