Sciweavers

590 search results - page 112 / 118
» Can We Learn to Beat the Best Stock
Sort
View
LOGCOM
2008
104views more  LOGCOM 2008»
14 years 9 months ago
Testing the Reasoning for Question Answering Validation
Question Answering (QA) is a task that deserves more collaboration between Natural Language Processing (NLP) and Knowledge Representation (KR) communities, not only to introduce r...
Anselmo Peñas, Álvaro Rodrigo, Valen...
78
Voted
SIGIR
2008
ACM
14 years 9 months ago
Knowledge transformation from word space to document space
In most IR clustering problems, we directly cluster the documents, working in the document space, using cosine similarity between documents as the similarity measure. In many real...
Tao Li, Chris H. Q. Ding, Yi Zhang 0005, Bo Shao
HPCA
2009
IEEE
15 years 10 months ago
Adaptive Spill-Receive for robust high-performance caching in CMPs
In a Chip Multi-Processor (CMP) with private caches, the last level cache is statically partitioned between all the cores. This prevents such CMPs from sharing cache capacity in r...
Moinuddin K. Qureshi
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
15 years 10 months ago
Empirical comparisons of various voting methods in bagging
Finding effective methods for developing an ensemble of models has been an active research area of large-scale data mining in recent years. Models learned from data are often subj...
Kelvin T. Leung, Douglas Stott Parker Jr.
ASIACRYPT
2009
Springer
15 years 4 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan