513 search results - page 21 / 103 » Soft Edge Coloring |
104
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Object detection in unconstrained images is an important image understanding problem with many potential applications. There has been little success in creating a single algorithm...
113
Voted
MST
2010
14 years 11 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
ICASSP
2010
IEEE
15 years 19 days ago
2010
IEEE
In this paper we reveal a connection between the coefficients of the morphological wavelet transform and complexity measures of dyadic tree representations of level sets. This le...
101
Voted
DAM
2002
15 years 8 days ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
85
Voted
ECCV
2004
Springer
15 years 5 months ago
2004
Springer
Soft biometric traits like gender, age, height, weight, ethnicity, and eye color cannot provide reliable user recognition because they are not distinctive and permanent. However, s...