Sciweavers

2434 search results - page 141 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
106
Voted
IJCNN
2006
IEEE
15 years 9 months ago
Co-training using RBF Nets and Different Feature Splits
—In this paper we propose a new graph-based feature splitting algorithm maxInd, which creates a balanced split maximizing the independence between the two feature sets. We study ...
Felix Feger, Irena Koprinska
126
Voted
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
15 years 5 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
119
Voted
JACM
2007
79views more  JACM 2007»
15 years 3 months ago
A new look at survey propagation and its generalizations
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainw...
127
Voted
ICML
2000
IEEE
16 years 4 months ago
Using Error-Correcting Codes for Text Classification
This paper explores in detail the use of Error Correcting Output Coding (ECOC) for learning text classifiers. We show that the accuracy of a Naive Bayes Classifier over text class...
Rayid Ghani
123
Voted
TIT
2008
95views more  TIT 2008»
15 years 3 months ago
On the Delay and Throughput Gains of Coding in Unreliable Networks
In an unreliable packet network setting, we study the performance gains of optimal transmission strategies in the presence and absence of coding capability at the transmitter, wher...
Atilla Eryilmaz, Asuman E. Ozdaglar, Muriel M&eacu...