Sciweavers

539 search results - page 55 / 108
» Recurrence relations and fast algorithms
Sort
View
111
Voted
AAAI
2007
15 years 2 months ago
A Mathematical Programming Formulation for Sparse Collaborative Computer Aided Diagnosis
A mathematical programming formulation is proposed to eliminate irrelevant and redundant features for collaborative computer aided diagnosis which requires to detect multiple clin...
Jinbo Bi, Tao Xiong
CCA
2005
Springer
15 years 2 months ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi
86
Voted
ICGA
1997
86views Optimization» more  ICGA 1997»
15 years 1 months ago
Performance of Diploid Dominance with Genetically Synthesized Signal Processing Networks
A methodology is described for synthesizing signal processing networks, which are used to solve a low-cost medical signal processing problem. The approach makes use of genetic alg...
F. Greene
AVSS
2009
IEEE
15 years 7 months ago
Global Illumination Compensation for Background Subtraction Using Gaussian-Based Background Difference Modeling
This paper presents a background segmentation technique, which is able to process acceptable segmentation masks under fast global illumination changes. The histogram of the frame-...
Julien A. Vijverberg, Marijn J. H. Loomans, Cornel...
ISMIR
2004
Springer
133views Music» more  ISMIR 2004»
15 years 5 months ago
Understanding Search Performance in Query-by-Humming Systems
Previous work in Query-by-Humming systems has left open many questions. Although a variety of techniques have been explored, there has been relatively little work to compare them ...
Roger B. Dannenberg, Ning Hu