Sciweavers

3600 search results - page 326 / 720
» The settling-time reducibility ordering
Sort
View
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
16 years 26 days ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall
IBPRIA
2007
Springer
16 years 26 days ago
False Positive Reduction in Breast Mass Detection Using Two-Dimensional PCA
In this paper we present a novel method for reducing false positives in breast mass detection. Our approach is based on using the Two-Dimensional Principal Component Analysis (2DPC...
Arnau Oliver, Xavier Lladó, Joan Mart&iacut...
MDM
2007
Springer
16 years 26 days ago
The MicroPulse Framework for Adaptive Waking Windows in Sensor Networks
Abstract—In this paper we present MicroPulse, a novel framework for adapting the waking window of a sensing device S based on the data workload incurred by a query Q. Assuming a ...
Demetrios Zeinalipour-Yazti, Panayiotis Andreou, P...
TSD
2007
Springer
16 years 25 days ago
On the Relative Hardness of Clustering Corpora
Abstract. Clustering is often considered the most important unsupervised learning problem and several clustering algorithms have been proposed over the years. Many of these algorit...
David Pinto, Paolo Rosso
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
16 years 25 days ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...