Sciweavers

2370 search results - page 274 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
EJC
2007
15 years 3 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
107
Voted
CLUSTER
2000
IEEE
15 years 3 months ago
Dynamic Max-Min fairness in ring networks
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Y...

Publication
1851views
17 years 4 months ago
Cerebrovascular Segmentation from TOF Using Stochastic Models
In this paper, we present an automatic statistical approach for extracting 3D blood vessels from time-of-flight (TOF) magnetic resonance angiography (MRA) data. The voxels of the d...
M. Sabry Hassouna, Aly A. Farag, Stephen Hushek, T...
ALT
2008
Springer
16 years 20 days ago
Optimal Language Learning
Gold’s original paper on inductive inference introduced a notion of an optimal learner. Intuitively, a learner identifies a class of objects optimally iff there is no other lea...
John Case, Samuel E. Moelius
KBSE
2009
IEEE
15 years 10 months ago
Static Validation of C Preprocessor Macros
—The widely used C preprocessor (CPP) is generally considered a source of difficulty for understanding and maintaining C/C++ programs. The main reason for this difficulty is CP...
Andreas Saebjoernsen, Lingxiao Jiang, Daniel J. Qu...