4926 search results - page 195 / 986 » Two Graph Algorithms On an Associative Computing Model |
157
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
182
click to vote
MOBIHOC
2001
ACM
16 years 5 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
208
click to vote
IPPS
2007
IEEE
16 years 17 days ago
2007
IEEE
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...
142
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
186
click to vote
ISLPED
2003
ACM
15 years 11 months ago
2003
ACM
We propose a novel power-aware task scheduling algorithm for DVS-enabled real-time multiprocessor systems. Unlike the existing algorithms, the proposed DVS algorithm can handle co...