Sciweavers

1241 search results - page 66 / 249
» Path-oriented random testing
Sort
View
ICIP
2007
IEEE
15 years 8 months ago
Multiscale Random Projections for Compressive Classification
We propose a framework for exploiting dimension-reducing random projections in detection and classification problems. Our approach is based on the generalized likelihood ratio te...
Marco F. Duarte, Mark A. Davenport, Michael B. Wak...
113
Voted
ICMCS
2007
IEEE
143views Multimedia» more  ICMCS 2007»
15 years 8 months ago
Hidden Conditional Random Fields for Meeting Segmentation
Automatic segmentation and classification of recorded meetings provides a basis towards understanding the content of a meeting. It enables effective browsing and querying in a me...
Stephan Reiter, Björn Schuller, Gerhard Rigol...
AAAI
2000
15 years 3 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
BIOINFORMATICS
2010
94views more  BIOINFORMATICS 2010»
15 years 2 months ago
Globally, unrelated protein sequences appear random
Motivation: To test whether protein folding constraints and secondary structure sequence preferences significantly reduce the space of amino acid words in proteins, we compared th...
Daniel T. Lavelle, William R. Pearson
133
Voted
IESS
2007
Springer
110views Hardware» more  IESS 2007»
15 years 8 months ago
Run-Time efficient Feasibility Analysis of Uni-Processor Systems with Static Priorities
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...
Karsten Albers, Frank Bodmann, Frank Slomka