Sciweavers

388 search results - page 59 / 78
» The covering number in learning theory
Sort
View
CCECE
2006
IEEE
14 years 1 months ago
A Dynamic Associative E-Learning Model based on a Spreading Activation Network
Presenting information to an e-learning environment is a challenge, mostly, because ofthe hypertextlhypermedia nature and the richness ofthe context and information provides. This...
Phongchai Nilas, Nilamit Nilas, Somsak Mitatha
DAC
2005
ACM
14 years 8 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
KDD
2005
ACM
168views Data Mining» more  KDD 2005»
14 years 7 months ago
Nomograms for visualizing support vector machines
We propose a simple yet potentially very effective way of visualizing trained support vector machines. Nomograms are an established model visualization technique that can graphica...
Aleks Jakulin, Martin Mozina, Janez Demsar, Ivan B...
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
14 years 26 days ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
COLT
2004
Springer
14 years 23 days ago
A Statistical Mechanics Analysis of Gram Matrix Eigenvalue Spectra
Abstract. The Gram matrix plays a central role in many kernel methods. Knowledge about the distribution of eigenvalues of the Gram matrix is useful for developing appropriate model...
David C. Hoyle, Magnus Rattray