4926 search results - page 395 / 986 » Two Graph Algorithms On an Associative Computing Model |
115
click to vote
IJCV
2006
15 years 4 months ago
2006
In this paper, we suggest a variational model for optic flow computation based on non-linearised and higher order constancy assumptions. Besides the common grey value constancy ass...
158
click to vote
Publication
Current mainstream Evolutionary Algorithms (EA) are based on the concept of selection, encapsulated in the definition of a fitness function. Besides selection, however, the natur...
139
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Spectral clustering is a simple yet powerful method for finding structure in data using spectral properties of an associated pairwise similarity matrix. This paper provides new in...
150
click to vote
TVCG
2008
15 years 4 months ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
149
click to vote
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...