Sciweavers

6110 search results - page 1220 / 1222
» Approximate Computing
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
13 years 18 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
IACR
2011
87views more  IACR 2011»
12 years 9 months ago
Is privacy compatible with truthfulness?
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
David Xiao

Publication
197views
12 years 5 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
CORR
2012
Springer
227views Education» more  CORR 2012»
12 years 5 months ago
Trajectory and Policy Aware Sender Anonymity in Location Based Services
We consider Location-based Service (LBS) settings, where a LBS provider logs the requests sent by mobile device users over a period of time and later wants to publish/share these ...
Alin Deutsch, Richard Hull, Avinash Vyas, Kevin Ke...
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 5 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
« Prev « First page 1220 / 1222 Last » Next »