4926 search results - page 579 / 986 » Two Graph Algorithms On an Associative Computing Model |
122
click to vote
CN
2008
15 years 3 months ago
2008
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
145
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
139
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
143
click to vote
IVC
2007
15 years 3 months ago
2007
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
124
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...