1243 search results - page 153 / 249 » Complexity reduction of C-Algorithm |
113
click to vote
PKC
1999
Springer
15 years 5 months ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
118
click to vote
NIPS
2003
15 years 2 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
105
click to vote
AAAI
1993
15 years 2 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
129
click to vote
CJ
2004
15 years 1 months ago
2004
Building footprint simplification is of critical importance to radio propagation predictions in wireless communication systems as the prediction time is closely related to the num...
131
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...