4926 search results - page 300 / 986 » Two Graph Algorithms On an Associative Computing Model |
156
Voted
CORR
2010
Springer
15 years 15 hour ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
143
Voted
GD
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
185
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
141
Voted
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
169
click to vote
RTSS
1995
IEEE
15 years 8 months ago
1995
IEEE
E cient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. Howe...