Sciweavers

5128 search results - page 196 / 1026
» Discrete Component Analysis
Sort
View
COMPGEOM
2008
ACM
15 years 5 months ago
Tighter bounds for random projections of manifolds
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
Kenneth L. Clarkson
IJNSEC
2007
131views more  IJNSEC 2007»
15 years 3 months ago
On the Security of Huang-Chang Multi-signature Schemes
Recently, based on RSA and discrete logarithm with composite modulus, Huang and Chang proposed two multisignature schemes with distinguished signing authority and claimed that the...
Jianhong Zhang, Wei Zou
114
Voted
AMC
2004
95views more  AMC 2004»
15 years 3 months ago
Optimal multigrid solutions of two-dimensional convection-conduction problems
The present work investigates the efficiency of the multigrid numerical method when used to solve two-dimensional laminar velocity and temperature fields inside a rectangular doma...
Maximilian S. Mesquita, Marcelo J. S. de Lemos
121
Voted
MOC
1998
90views more  MOC 1998»
15 years 3 months ago
Numerical solution of parabolic integro-differential equations by the discontinuous Galerkin method
The numerical solution of a parabolic equation with memory is considered. The equation is first discretized in time by means of the discontinuous Galerkin method with piecewise co...
Stig Larsson, Vidar Thomée, Lars B. Wahlbin
157
Voted
AOR
2010
15 years 27 days ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean