4926 search results - page 64 / 986 » Two Graph Algorithms On an Associative Computing Model |
125
click to vote
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Kernel associative memory (KAM) has previously been proposed as an efficient scheme for face recognition. In this paper, a hybrid method of combining KAM and Gabor wavelet transfo...
102
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
125
click to vote
JGAA
2006
15 years 2 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
105
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
113
click to vote
IPSN
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...