Sciweavers

2015 search results - page 382 / 403
» Some Observations on Indifferentiability
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 1 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
100
Voted
TRECVID
2008
15 years 1 months ago
Learning TRECVID'08 High-Level Features from YouTube
Run No. Run ID Run Description infMAP (%) training on TV08 data 1 IUPR-TV-M SIFT visual words with maximum entropy 6.1 2 IUPR-TV-MF SIFT with maximum entropy, fused with color+tex...
Adrian Ulges, Christian Schulze, Markus Koch, Thom...
NIPS
2004
15 years 1 months ago
Constraining a Bayesian Model of Human Visual Speed Perception
It has been demonstrated that basic aspects of human visual motion perception are qualitatively consistent with a Bayesian estimation framework, where the prior probability distri...
Alan Stocker, Eero P. Simoncelli
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
15 years 1 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
NIPS
2003
15 years 1 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand