4926 search results - page 313 / 986 » Two Graph Algorithms On an Associative Computing Model |
119
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
140
Voted
WSCG
2001
15 years 6 months ago
2001
Triangle strips are widely used as a method to accelerate the visualisation process of polygon models in interactive graphics applications. Another widely used method to improve d...
118
Voted
ICDCS
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
130
click to vote
TCS
2010
14 years 11 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
136
click to vote
EMMCVPR
2001
Springer
15 years 9 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...