65 search results - page 7 / 13 » Reducing Computational Costs in the Basic Perturbation Lemma |
BROADNETS
2007
IEEE
14 years 3 months ago
2007
IEEE
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
AGP
1994
IEEE
14 years 1 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
ICML
1994
IEEE
14 years 15 days ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
CGF
2010
13 years 9 months ago
2010
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
EUROCRYPT
2006
Springer
14 years 19 days ago
2006
Springer
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to crea...