193 search results - page 15 / 39 » Key Derivation for Squared-Friendly Applications: Lower Boun... |
70
Voted
NIPS
2007
14 years 11 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
SIAMNUM
2011
14 years 4 months ago
2011
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...
102
click to vote
ANSS
1991
IEEE
15 years 1 months ago
1991
IEEE
The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critica...
67
Voted
VMV
2008
14 years 11 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
JUCS
2007
14 years 9 months ago
2007
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...