Sciweavers

2040 search results - page 373 / 408
» On the Complexity of Error Explanation
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 8 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
OTM
2009
Springer
15 years 8 months ago
TMBean: Optimistic Concurrency in Application Servers Using Transactional Memory
Abstract. In this experience report, we present an evaluation of different techniques to manage concurrency in the context of application servers. Traditionally, using entity beans...
Lucas Charles, Pascal Felber, Christophe Gêt...
QOSA
2009
Springer
15 years 8 months ago
Adaptive Application Composition in Quantum Chemistry
Abstract. Component interfaces, as advanced by the Common Component Architecture (CCA), enable easy access to complex software packages for high-performance scientific computing. ...
Li Li, Joseph P. Kenny, Meng-Shiou Wu, Kevin A. Hu...
C3S2E
2009
ACM
15 years 8 months ago
CPU, SMP and GPU implementations of Nohalo level 1, a fast co-convex antialiasing image resampler
This article introduces Nohalo level 1 (“Nohalo”), the simplest member of a family of image resamplers which straighten diagonal interfaces without adding noticeable nonlinear...
Nicolas Robidoux, Minglun Gong, John Cupitt, Adam ...
IMC
2009
ACM
15 years 8 months ago
On calibrating enterprise switch measurements
The complexity of modern enterprise networks is ever-increasing, and our understanding of these important networks is not keeping pace. Our insight into intra-subnet traffic (sta...
Boris Nechaev, Vern Paxson, Mark Allman, Andrei Gu...