Sciweavers

10392 search results - page 1633 / 2079
» Introduction to Computer Science
Sort
View
ICS
2010
Tsinghua U.
16 years 4 months ago
Robustness of the Learning with Errors Assumption
: Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography community, to design cryptographic primitives that are s...
Shafi Goldwasser, Yael Kalai, Chris Peikert, Vinod...
ICS
2010
Tsinghua U.
16 years 4 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 4 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
PAKDD
2009
ACM
225views Data Mining» more  PAKDD 2009»
16 years 4 months ago
Change Analysis in Spatial Data by Combining Contouring Algorithms with Supervised Density Functions.
Detecting changes in spatial datasets is important for many fields. In this paper, we introduce a methodology for change analysis in spatial datasets that combines contouring algor...
Christoph F. Eick, Chun-Sheng Chen, Michael D. Twa...
SDM
2009
SIAM
127views Data Mining» more  SDM 2009»
16 years 4 months ago
Event Discovery in Time Series.
The discovery of events in time series can have important implications, such as identifying microlensing events in astronomical surveys, or changes in a patient’s electrocardiog...
Carla E. Brodley, Dan Preston, Pavlos Protopapas
« Prev « First page 1633 / 2079 Last » Next »