5606 search results - page 295 / 1122 » Randomization Techniques for Graphs. |
179
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract - Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constrai...
174
click to vote
SMI
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we describe a novel method for searching and comparing 3D objects. The method encodes the geometric and topological information in the form of a skeletal graph and ...
149
click to vote
CVIU
2008
15 years 6 months ago
2008
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
195
click to vote
OOPSLA
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
159
click to vote
GD
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...