Sciweavers

60 search results - page 4 / 12
» Bounds for parametric sequence comparison
Sort
View
MICCAI
2002
Springer
14 years 8 months ago
Improved Detection Sensitivity in Functional MRI Data Using a Brain Parcelling Technique
We present a comparison between a voxel based approach and a region based technique for detecting brain activation signals in sequences of functional Magnetic Resonance Images (fMR...
Guillaume Flandin, Ferath Kherif, Xavier Pennec, G...
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 7 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
ECOOP
1999
Springer
13 years 11 months ago
Foundations for Virtual Types
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...
Atsushi Igarashi, Benjamin C. Pierce

Publication
173views
12 years 6 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...