Sciweavers

1299 search results - page 34 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
TKDE
2012
192views Formal Methods» more  TKDE 2012»
13 years 2 days ago
Discriminative Feature Selection by Nonparametric Bayes Error Minimization
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...
Shuang-Hong Yang, Bao-Gang Hu
79
Voted
ISBI
2008
IEEE
15 years 10 months ago
Real-time segmentation of 4D ultrasound by Active Geometric Functions
Four-dimensional ultrasound based on matrix phased array transducers can capture the complex 4D cardiac motion in a complete and real-time fashion. However, the large amount of in...
Qi Duan, Elsa D. Angelini, Shunichi Homma, Andrew ...
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 9 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
67
Voted
GLVLSI
2005
IEEE
110views VLSI» more  GLVLSI 2005»
15 years 3 months ago
QCA channel routing with wire crossing minimization
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
Brian Stephen Smith, Sung Kyu Lim
69
Voted
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
14 years 11 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...