Sciweavers

1538 search results - page 49 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
MICCAI
2004
Springer
14 years 11 months ago
Automatic Heart Peripheral Vessels Segmentation Based on a Normal MIP Ray Casting Technique
This paper introduces a new technique to detect the coronary arteries as well as other heart's peripheral vessels. After finding the location of the myocardium through a graph...
Charles Florin, Romain Moreau-Gobard, James Willia...
WAW
2007
Springer
89views Algorithms» more  WAW 2007»
14 years 4 months ago
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet
Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculati...
Abraham D. Flaxman, Juan Vera
LCPC
2005
Springer
14 years 3 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
KAIS
2011
129views more  KAIS 2011»
13 years 5 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
VTC
2008
IEEE
117views Communications» more  VTC 2008»
14 years 4 months ago
Design of Rate Constrained Multi-User Receivers for Satellite Communications
—In the realm of satellite communications, one of the great impairments to increase the spectral efficiency is multi-user interference in the reverse link (mobile to satellite). ...
Sami Mekki, Mérouane Debbah