Sciweavers

7272 search results - page 1220 / 1455
» On the Performance of Selection Relaying
Sort
View
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 7 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
ML
2006
ACM
15 years 7 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
PAMI
2008
196views more  PAMI 2008»
15 years 7 months ago
Distance Learning for Similarity Estimation
In this paper, we present a general guideline to find a better distance measure for similarity estimation based on statistical analysis of distribution models and distance function...
Jie Yu, Jaume Amores, Nicu Sebe, Petia Radeva, Qi ...
MTA
2006
125views more  MTA 2006»
15 years 7 months ago
QCWS: an implementation of QoS-capable multimedia web services
QoS, that defines service quality such as latency, availability, timeliness and reliability, is important for web applications that provide real-time information, multimedia conte...
Tao Yu, Kwei-Jay Lin
NECO
2006
157views more  NECO 2006»
15 years 7 months ago
Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression
The application of boosting technique to the regression problems has received relatively little attention in contrast to the research aimed at classification problems. This paper ...
Durga L. Shrestha, Dimitri P. Solomatine
« Prev « First page 1220 / 1455 Last » Next »