Sciweavers

414 search results - page 40 / 83
» On discrete norms of polynomials
Sort
View
82
Voted
DM
2010
96views more  DM 2010»
15 years 19 days ago
On well-rounded sublattices of the hexagonal lattice
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
Lenny Fukshansky, Daniel Moore, R. Andrew Ohana, W...
101
Voted
MOC
2000
76views more  MOC 2000»
15 years 10 days ago
Optimal approximation of stochastic differential equations by adaptive step-size control
We study the pathwise (strong) approximation of scalar stochastic differential equations with respect to the global error in the L2-norm. For equations with additive noise we estab...
Norbert Hofmann, Thomas Müller-Gronbach, Klau...
SIAMNUM
2011
252views more  SIAMNUM 2011»
14 years 7 months ago
Analysis and Computation of Compatible Least-Squares Methods for div-curl Equations
We develop and analyze least-squares finite element methods for two complementary div-curl elliptic boundary value problems. The first one prescribes the tangential component of ...
Pavel B. Bochev, Kara Peterson, Christopher M. Sie...
111
Voted
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 4 months ago
The Rate of Convergence of AdaBoost
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
Indraneel Mukherjee, Cynthia Rudin, Robert E. Scha...
105
Voted
MASCOTS
2001
15 years 1 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement