4926 search results - page 412 / 986 » Two Graph Algorithms On an Associative Computing Model |
138
click to vote
STACS
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
151
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We propose a method for interactive colour image segmentation. The goal is to detect an object from the background, when some markers on object(s) and the background are given. As...
130
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
145
click to vote
JCP
2008
15 years 4 months ago
2008
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
155
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....