Sciweavers

4541 search results - page 524 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
CIKM
2009
Springer
15 years 11 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...
ICML
2004
IEEE
16 years 7 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
201
Voted
AAAI
2008
15 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
16 years 7 months ago
Large-scale behavioral targeting
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
Ye Chen, Dmitry Pavlov, John F. Canny
TVLSI
2008
139views more  TVLSI 2008»
15 years 6 months ago
Ternary CAM Power and Delay Model: Extensions and Uses
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
Banit Agrawal, Timothy Sherwood