2314 search results - page 337 / 463 » Minimal Partitions of a Graph |
134
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
132
Voted
APVIS
2003
15 years 5 months ago
2003
High cohesion, or module strength, indicates that a system has been well partitioned into components which have strong internal relationships. An understanding of cohesion is an i...
141
Voted
APVIS
2009
15 years 4 months ago
2009
We present a correlation study of time-varying multivariate volumetric data sets. In most scientific disciplines, to test hypotheses and discover insights, scientists are interest...
156
Voted
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
Today, it is possible to associate multiple CPUs and multiple GPUs in a single shared memory architecture. Using these resources efficiently in a seamless way is a challenging issu...
155
Voted
DCG
2010
15 years 3 months ago
2010
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...