Sciweavers

3946 search results - page 285 / 790
» The computational complexity of choice sets
Sort
View
ISCI
2007
130views more  ISCI 2007»
15 years 6 months ago
Learning to classify e-mail
In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a sup...
Irena Koprinska, Josiah Poon, James Clark, Jason C...
JMLR
2002
89views more  JMLR 2002»
15 years 6 months ago
A Robust Minimax Approach to Classification
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
DAGSTUHL
2008
15 years 8 months ago
A Modified Staggered Correction Arithmetic with Enhanced Accuracy and Very Wide Exponent Range
Abstract. A so called staggered precision arithmetic is a special kind of a multiple precision arithmetic based on the underlying floating point data format (typically IEEE double ...
Frithjof Blomquist, Werner Hofschuster, Walter Kr&...
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 6 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
CDES
2006
99views Hardware» more  CDES 2006»
15 years 8 months ago
Realization of Digital Fuzzy Operations Using Multi-Valued Fredkin Gates
Multi-valued Fredkin gates (MVFG) are reversible gates and they can be considered as modified version of the better known reversible gate the Fredkin gate. Reversible logic gates ...
Amin Ahsan Ali, Hafiz Md. Hasan Babu, Ahsan Raja C...