Sciweavers

951 search results - page 64 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
SIAMJO
2008
108views more  SIAMJO 2008»
15 years 3 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
JMIV
2007
99views more  JMIV 2007»
15 years 3 months ago
Image Similarity Based on Intensity Scaling
An image similarity measure based upon intensity scaling is investigated for the registration of images which differ in contast. The measure is introduced for both optical flow a...
Stephen L. Keeling
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
15 years 10 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 4 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
ICALP
2009
Springer
16 years 4 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson