Sciweavers

1068 search results - page 55 / 214
» For completeness, sublogarithmic space is no space
Sort
View
FOCM
2011
117views more  FOCM 2011»
13 years 3 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
JDCTA
2010
228views more  JDCTA 2010»
13 years 3 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
MEMETIC
2010
311views more  MEMETIC 2010»
13 years 3 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
PAMI
2012
11 years 11 months ago
A Blur-Robust Descriptor with Applications to Face Recognition
—Understanding the effect of blur is an important problem in unconstrained visual analysis. We address this problem in the context of image-based recognition, by a fusion of imag...
Raghuraman Gopalan, Sima Taheri, Pavan K. Turaga, ...
TAP
2010
Springer
102views Hardware» more  TAP 2010»
14 years 1 months ago
Generating High-Quality Tests for Boolean Circuits by Treating Tests as Proof Encoding
Abstract. We consider the problem of test generation for Boolean combinational circuits. We use a novel approach based on the idea of treating tests as a proof encoding rather than...
Eugene Goldberg, Panagiotis Manolios