Sciweavers

250 search results - page 2 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
ICIP
2002
IEEE
14 years 7 months ago
Fitting smooth surfaces to scattered 3D data using piecewise quadratic approximation
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
Hélio Pedrini, Murilo Vicente Gonçal...
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
13 years 7 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
ACSAC
2009
IEEE
13 years 9 months ago
Justifying Integrity Using a Virtual Machine Verifier
Emerging distributed computing architectures, such as grid and cloud computing, depend on the high integrity execution of each system in the computation. While integrity measuremen...
Joshua Schiffman, Thomas Moyer, Christopher Shal, ...
RTSS
2002
IEEE
13 years 10 months ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
IJCAI
2007
13 years 6 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak