4966 search results - page 102 / 994 » its 2010 |
141
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...
130
click to vote
IPL
2010
15 years 4 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
162
click to vote
JAT
2010
15 years 4 months ago
2010
We give a bivariate analog of the Micchelli-Rivlin quadrature for computing the integral of a function over the unit disk using its Radon projections. AMS subject classification:...
154
click to vote
JMIV
2010
15 years 4 months ago
2010
Motivated by the setting of reproducing kernel Hilbert space (RKHS) and its extensions considered in machine learning, we propose an RKHS framework for image and video colorizatio...
146
click to vote
SIAMDM
2010
15 years 4 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...