Sciweavers

3204 search results - page 207 / 641
» The Alcuin Number of a Graph
Sort
View
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
16 years 4 days ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
LCPC
2009
Springer
15 years 10 months ago
Using the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
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...
Mounira Bachir, David Gregg, Sid Ahmed Ali Touati
MICCAI
2001
Springer
15 years 10 months ago
Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models
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...
Yuri Boykov, Vivian S. Lee, Henry Rusinek, Ravi Ba...
CC
1998
Springer
111views System Software» more  CC 1998»
15 years 5 months ago
Live Range Splitting in a Graph Coloring Register Allocator
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 ...
Keith D. Cooper, L. Taylor Simpson
TAOSD
2010
15 years 4 months ago
A Graph-Based Aspect Interference Detection Approach for UML-Based Aspect-Oriented Models
Abstract. Aspect Oriented Modeling (AOM) techniques facilitate separate modeling of concerns and allow for a more flexible composition of these than traditional modeling technique...
Selim Ciraci, Wilke Havinga, Mehmet Aksit, Christo...