Sciweavers

4372 search results - page 406 / 875
» Algorithmic Theories of Everything
Sort
View
ICML
2010
IEEE
15 years 8 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
RECSYS
2010
ACM
15 years 7 months ago
Incremental collaborative filtering via evolutionary co-clustering
Collaborative filtering is a popular approach for building recommender systems. Current collaborative filtering algorithms are accurate but also computationally expensive, and so ...
Mohammad Khoshneshin, W. Nick Street
CORR
2010
Springer
60views Education» more  CORR 2010»
15 years 7 months ago
A Novel Scheme for Secured Data Transfer Over Computer Networks
: This paper presents a novel encryption-less algorithm to enhance security in transmission of data in networks. The algorithm uses an intuitively simple idea of a `jigsaw puzzle&#...
Rangarajan Vasudevan, Ajith Abraham, Sugata Sanyal
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 7 months ago
Empirical learning aided by weak domain knowledge in the form of feature importance
Standard hybrid learners that use domain knowledge require stronger knowledge that is hard and expensive to acquire. However, weaker domain knowledge can benefit from prior knowle...
Ridwan Al Iqbal
IANDC
2008
122views more  IANDC 2008»
15 years 7 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza