3471 search results - page 355 / 695 » Obstacle Numbers of Graphs |
216
click to vote
LCPC
2009
Springer
16 years 2 days ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
205
Voted
MICCAI
2001
Springer
15 years 12 months ago
2001
Springer
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
275
click to vote
VDA
2010
15 years 10 months ago
2010
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
174
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
228
Voted
CC
1998
Springer
15 years 7 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...