Sciweavers

16430 search results - page 114 / 3286
» On Computable Tree Functions
Sort
View
131
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
TVLSI
1998
124views more  TVLSI 1998»
15 years 3 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
112
Voted
ICCHP
2004
Springer
15 years 8 months ago
Neuropsychological Function for Accessibility of Computer Program for People with Mental Retardation
The extent to which people with mental retardation are benefit from the modern information technology is not well explored. A better understanding on ways that the existing human-c...
Alex W. W. Wong, Chetwyn C. H. Chan, Cecilia W. P....
81
Voted
COMPUTING
1999
107views more  COMPUTING 1999»
15 years 3 months ago
A Derivative-Free Algorithm for Computing Zeros of Analytic Functions
Peter Kravanja, Marc Van Barel
110
Voted
FOCM
2011
117views more  FOCM 2011»
14 years 10 months ago
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...
Folkmar Bornemann