Sciweavers

2173 search results - page 301 / 435
» On the Values of Reducibility Candidates
Sort
View
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
16 years 6 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 6 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
16 years 6 months ago
A geometric approach to monitoring threshold functions over distributed data streams
Monitoring data streams in a distributed system is the focus of much research in recent years. Most of the proposed schemes, however, deal with monitoring simple aggregated values...
Izchak Sharfman, Assaf Schuster, Daniel Keren
SIGMOD
2003
ACM
111views Database» more  SIGMOD 2003»
16 years 6 months ago
Extended Wavelets for Multiple Measures
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...
Antonios Deligiannakis, Nick Roussopoulos
EDBT
2008
ACM
146views Database» more  EDBT 2008»
16 years 6 months ago
Attribute selection in multivariate microaggregation
Microaggregation is one of the most employed microdata protection methods. The idea is to build clusters of at least k original records, and then replace them with the centroid of...
Javier Herranz, Jordi Nin, Vicenç Torra