1414 search results - page 100 / 283 » Randomness and Universal Machines |
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
ALT
2005
Springer
14 years 7 months ago
2005
Springer
This paper deals with an unusual phenomenon where most machine learning algorithms yield good performance on the training set but systematically worse than random performance on th...
EMNLP
2008
13 years 11 months ago
2008
The Named Entity Recognition (NER) task has been garnering significant attention in NLP as it helps improve the performance of many natural language processing applications. In th...
ICALT
2008
IEEE
14 years 4 months ago
2008
IEEE
“Lemat” is an acronym for Libro Electrónico de Matemáticas, which means Electronic Book of Mathematics. It is a project developed by a group of teachers at secondary school ...