Sciweavers

1332 search results - page 246 / 267
» ideas 2008
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 10 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 10 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 10 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
KDD
2008
ACM
184views Data Mining» more  KDD 2008»
14 years 10 months ago
Joint latent topic models for text and citations
In this work, we address the problem of joint modeling of text and citations in the topic modeling framework. We present two different models called the Pairwise-Link-LDA and the ...
Ramesh Nallapati, Amr Ahmed, Eric P. Xing, William...
CHI
2008
ACM
14 years 10 months ago
Usability evaluation considered harmful (some of the time)
Current practice in Human Computer Interaction as encouraged by educational institutes, academic review processes, and institutions with usability groups advocate usability evalua...
Saul Greenberg, William Buxton