Sciweavers

2996 search results - page 312 / 600
» Numberings and Randomness
Sort
View
168
Voted
ICML
2006
IEEE
16 years 7 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
ICML
2004
IEEE
16 years 7 months ago
Learning and evaluating classifiers under sample selection bias
Classifier learning methods commonly assume that the training data consist of randomly drawn examples from the same distribution as the test examples about which the learned model...
Bianca Zadrozny
ICML
2000
IEEE
16 years 7 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
PKC
2009
Springer
115views Cryptology» more  PKC 2009»
16 years 7 months ago
Compact CCA-Secure Encryption for Messages of Arbitrary Length
This paper proposes a chosen-ciphertext secure variant of the ElGamal public-key encryption scheme which generates very compact ciphertexts for messages of arbitrary length. The ci...
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 7 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...