1187 search results - page 105 / 238 » The Generalized Dimensionality Reduction Problem |
166
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
ISSRE
2006
IEEE
15 years 3 months ago
2006
IEEE
Test suite reduction uses test requirement coverage to determine if the reduced test suite maintains the original suite’s requirement coverage. Based on observations from our pr...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
117
click to vote
EUROCRYPT
2010
Springer
14 years 10 months ago
2010
Springer
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
SDM
2010
SIAM
14 years 8 months ago
2010
SIAM
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...