Sciweavers

2795 search results - page 353 / 559
» Recommended or Not
Sort
View
CHES
2009
Springer
229views Cryptology» more  CHES 2009»
14 years 11 months ago
KATAN and KTANTAN - A Family of Small and Efficient Hardware-Oriented Block Ciphers
Abstract. In this paper we propose a new family of very efficient hardware oriented block ciphers. The family contains six block ciphers divided into two flavors. All block ciphers...
Christophe De Cannière, Orr Dunkelman, Miro...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 11 months ago
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
Gu Xu, Shuang-Hong Yang, Hang Li
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 11 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
KDD
2008
ACM
110views Data Mining» more  KDD 2008»
14 years 11 months ago
Mining preferences from superior and inferior examples
Mining user preferences plays a critical role in many important applications such as customer relationship management (CRM), product and service recommendation, and marketing camp...
Bin Jiang, Jian Pei, Xuemin Lin, David W. Cheung, ...
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 11 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church