Sciweavers

139 search results - page 3 / 28
» Reducibilities Relating to Schnorr Randomness
Sort
View
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 7 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
14 years 5 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
CHI
2005
ACM
14 years 5 months ago
Using context-aware computing to reduce the perceived burden of interruptions from mobile devices
The potential for sensor-enabled mobile devices to proactively present information when and where users need it ranks among the greatest promises of ubiquitous computing. Unfortun...
Joyce Ho, Stephen S. Intille
CVPR
2011
IEEE
13 years 19 days ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan
AUSAI
2007
Springer
13 years 11 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan