Sciweavers

1670 search results - page 27 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
AH
2006
Springer
14 years 2 months ago
Ways of Computing Diverse Collaborative Recommendations
Abstract. Conversational recommender systems adapt the sets of products they recommend in light of user feedback. Our contribution here is to devise and compare four different mec...
Derek G. Bridge, John Paul Kelly
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 8 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
CVPR
2008
IEEE
14 years 10 months ago
A fast local descriptor for dense matching
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
Engin Tola, Vincent Lepetit, Pascal Fua
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 8 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 11 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun