Sciweavers

15485 search results - page 2520 / 3097
» Computing Optimal Subsets
Sort
View
SIAMSC
2008
151views more  SIAMSC 2008»
15 years 7 months ago
Accurate Floating-Point Summation Part I: Faithful Rounding
Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e. the result is one of the immediate floating-point ...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
SAC
2006
ACM
15 years 7 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...

Publication
139views
15 years 7 months ago
Separation of concerns in compiler development using aspect-orientation
A major difficulty in compiler development regards the proper modularization of concerns among the various compiler phases. The traditional object-oriented development paradigm ha...
SIGMETRICS
2008
ACM
119views Hardware» more  SIGMETRICS 2008»
15 years 7 months ago
Analysis of bittorrent-like protocols for on-demand stored media streaming
This paper develops analytic models that characterize the behavior of on-demand stored media content delivery using BitTorrent-like protocols. The models capture the effects of di...
Nadim Parvez, Carey L. Williamson, Anirban Mahanti...
IPL
2007
111views more  IPL 2007»
15 years 7 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
« Prev « First page 2520 / 3097 Last » Next »