Sciweavers

6693 search results - page 819 / 1339
» Methods of Automatic Algorithm Generation
Sort
View
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
15 years 10 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers
AAAI
2007
15 years 8 months ago
Manifold Denoising as Preprocessing for Finding Natural Representations of Data
A natural representation of data is given by the parameters which generated the data. If the space of parameters is continuous, then we can regard it as a manifold. In practice, w...
Matthias Hein, Markus Maier
TMI
2008
85views more  TMI 2008»
15 years 6 months ago
Sparsity-Enforced Slice-Selective MRI RF Excitation Pulse Design
We introduce a novel algorithm for the design of fast slice-selective spatially-tailored magnetic resonance imaging (MRI) excitation pulses. This method, based on sparse approximat...
Adam C. Zelinski, Lawrence L. Wald, K. Setsompop, ...
CVBIA
2005
Springer
15 years 12 months ago
Fast 3D Brain Segmentation Using Dual-Front Active Contours with Optional User-Interaction
Abstract. Important attributes of 3D brain segmentation algorithms include robustness, accuracy, computational efficiency, and facilitation of user interaction, yet few algorithms ...
Hua Li, Anthony J. Yezzi, Laurent D. Cohen
ICDM
2003
IEEE
92views Data Mining» more  ICDM 2003»
15 years 11 months ago
Validating and Refining Clusters via Visual Rendering
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...
Keke Chen, Ling Liu