2654 search results - page 338 / 531 » On Pairing Inversion Problems |
152
click to vote
ENDM
2008
15 years 5 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
111
click to vote
CVIU
2006
15 years 5 months ago
2006
We present an approach for whole-body pose contour matching. Contour matching in natural images in the absence of foreground-background segmentation is difficult. Usually an asymm...
185
Voted
IJDMB
2008
15 years 5 months ago
2008
: This paper addresses the sparse data problem in the linear regression model, namely the number of variables is significantly larger than the number of the data points for regress...
140
click to vote
JALC
2008
15 years 5 months ago
2008
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
137
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the...