5316 search results - page 115 / 1064 » Which Search Problems Are Random |
131
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Although it has been studied for several years by computer vision and machine learning communities, image annotation is still far from practical. In this paper, we present AnnoSea...
176
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We consider the problem of multi-label, supervised image segmentation when an initial labeling of some pixels is given. In this paper, we propose a new generative image segmentatio...
125
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
129
Voted
KELSI
2004
Springer
15 years 8 months ago
2004
Springer
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
144
click to vote
FSTTCS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...