Sciweavers

1766 search results - page 125 / 354
» Classifier Selection Based on Data Complexity Measures
Sort
View
ALMOB
2006
135views more  ALMOB 2006»
14 years 10 months ago
P-value based visualization of codon usage data
Two important and not yet solved problems in bacterial genome research are the identification of horizontally transferred genes and the prediction of gene expression levels. Both ...
Peter Meinicke, Thomas Brodag, Wolfgang Florian Fr...
ICASSP
2011
IEEE
14 years 1 months ago
Using F0 to constrain the unit selection Viterbi network
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
Alistair Conkie, Ann K. Syrdal
VLDB
2004
ACM
155views Database» more  VLDB 2004»
15 years 3 months ago
AWESOME - A Data Warehouse-based System for Adaptive Website Recommendations
Recommendations are crucial for the success of large websites. While there are many ways to determine recommendations, the relative quality of these recommenders depends on many f...
Andreas Thor, Erhard Rahm
CCS
2007
ACM
15 years 4 months ago
Defining categories to select representative attack test-cases
To ameliorate the quality of protection provided by intrusion detection systems (IDS) we strongly need more effective evaluation and testing procedures. Evaluating an IDS against ...
Mohammed S. Gadelrab, Anas Abou El Kalam, Yves Des...
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 3 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...