Sciweavers

3819 search results - page 101 / 764
» Predicting Dependability by Testing
Sort
View
COLT
1999
Springer
14 years 6 days ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
ISESE
2006
IEEE
14 years 1 months ago
An empirical evaluation of a testing and debugging methodology for Excel
Spreadsheets are one of the most commonly used types of programs in the world, and it is important that they be sufficiently dependable. To help end users who create spreadsheets ...
Jeffrey Carver, Marc Fisher II, Gregg Rothermel
JTRES
2010
ACM
13 years 8 months ago
Exhaustive testing of safety critical Java
With traditional testing, the test case has no control over non-deterministic scheduling decisions, and thus errors dependent on scheduling are only found by pure chance. Java Pat...
Tomás Kalibera, Pavel Parizek, Michal Maloh...
WSDM
2010
ACM
160views Data Mining» more  WSDM 2010»
14 years 5 months ago
Learning Concept Importance Using a Weighted Dependence Model
Modeling query concepts through term dependencies has been shown to have a significant positive effect on retrieval performance, especially for tasks such as web search, where rel...
Michael Bendersky, Donald Metzler, W. Bruce Croft
ESWA
2006
122views more  ESWA 2006»
13 years 8 months ago
Transmembrane segments prediction and understanding using support vector machine and decision tree
In recent years, there have been many studies focusing on improving the accuracy of prediction of transmembrane segments, and many significant results have been achieved. In spite...
Jieyue He, Hae-Jin Hu, Robert W. Harrison, Phang C...