Sciweavers

526 search results - page 5 / 106
» On the Number of Minimal Addition Chains
Sort
View
DCG
2000
104views more  DCG 2000»
14 years 9 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
CORR
2007
Springer
111views Education» more  CORR 2007»
14 years 9 months ago
Comments on "Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more ...
Matthieu Gallet, Yves Robert, Frédér...
ISQED
2007
IEEE
162views Hardware» more  ISQED 2007»
15 years 3 months ago
Balanced Scheduling and Operation Chaining in High-Level Synthesis for FPGA Designs
In high-level synthesis for FPGA designs, scheduling and chaining of operations for optimal performance remain challenging problems. In this paper, we present a balanced schedulin...
David Zaretsky, Gaurav Mittal, Robert P. Dick, Pri...
97
Voted
DSD
2004
IEEE
106views Hardware» more  DSD 2004»
15 years 1 months ago
Finite Precision Analysis of Support Vector Machine Classification in Logarithmic Number Systems
In this paper we present an analysis of the minimal hardware precision required to implement Support Vector Machine (SVM) classification within a Logarithmic Number System archite...
Faisal M. Khan, Mark G. Arnold, William M. Potteng...
CCCG
2009
14 years 10 months ago
Optimal Empty Pseudo-Triangles in a Point Set
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher