Search for Topics All Reviews
	Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > Approximation (G.1.2)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 127 Reviews about "Approximation (G.1.2)": Date Reviewed   Low-rank approximation: algorithms, implementation, applications (2nd ed.) Markovsky I., Springer International Publishing, New York, NY, 2019. 272 pp.  Type: Book (978-3-319896-19-9) Low-rank approximation (LRA) is an abstract framework for approximately solving many highly complex problems in science and engineering within acceptable time limits. Concrete implementations of LRA-based algorithms for specific proble... Jul 18 2019   FPT approximation schemes for maximizing submodular functions Skowron P. Information and Computation 257(C): 65-78, 2017.  Type: Article A survey of techniques, this paper presents and analyzes algorithms and constructs fixed parameter tractable approximation schemes. These schemes are “collections of algorithms that run in [fixed parameter tractable, FPT] tim... Jan 4 2019   On an new algorithm for function approximation with full accuracy in the presence of discontinuities based on the immersed interface method Amat S., Li Z., Ruiz J. Journal of Scientific Computing 75(3): 1500-1534, 2018.  Type: Article Linear algorithms for the approximation of smooth functions are stable and convergent, but if the functions are piecewise continuous then we encounter diffusion and the Gibbs effect [1].... Dec 6 2018   Clustering millions of faces by identity Otto C., Wang D., Jain A. IEEE Transactions on Pattern Analysis and Machine Intelligence 40(2): 289-303, 2018.  Type: Article Face recognition of individuals from several million images is useful for solving crimes. How should hundreds of millions of untagged face images be grouped into an unspecified number of identities? Otto et al. present an effective alg... Oct 24 2018   Framelets and wavelets: algorithms, analysis, and applications Han B., Birkhäuser Basel, Cham, Switzerland, 2017. 724 pp.  Type: Book (978-3-319685-29-8) The book describes the theory and application of wavelets and framelets. Particularly, it presents an extensive study of the design of various types of filter banks. The book is part of Springer’s “Applied and Numer... Jun 29 2018   Sparsification and subexponential approximation Bonnet E., Paschos V. Acta Informatica 55(1): 1-15, 2018.  Type: Article A sparsification of a problem maps the problem to a set of similar problems, each of which has its parameters bounded by some fixed number. For example, in the case of a graph-based problem, the degree might be one parameter. The solut... Jun 14 2018   Antenna orientation and range assignment algorithms in directional WSNs Tran T., An M., Huynh D. IEEE/ACM Transactions on Networking 25(6): 3368-3381, 2017.  Type: Article Traditional omni-directional wireless sensor networks (WSNs) are commonly modeled as directed graphs. Sensor devices have a limited battery; thus, reducing energy consumption by topology control is a crucial problem. It is a great chal... Jun 13 2018   An FPT 2-approximation for tree-cut decomposition Kim E., Oum S., Paul C., Sau I., Thilikos D. Algorithmica 80(1): 116-135, 2018.  Type: Article Fixed-parameter tractable (FPT) computational-complexity classification seeks to measure complexity as functions of problems’ parameters. The algorithm presented in this 20-page advanced paper concerns the FPT approach to &am... May 7 2018   α-concave hull, a generalization of convex hull Asaeedi S., Didehvar F., Mohades A. Theoretical Computer Science 702 48-59, 2017.  Type: Article The calculation of the minima and maxima from convex hulls is an important research area in optimization, machine learning, and related fields. Mathematics and machine learning researchers have come up with innovative algorithms to qui... Apr 10 2018   Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks Peng B., Fisher N. Real-Time Systems 53(6): 957-986, 2017.  Type: Article Job (task) scheduling is one of the oldest problems in mathematics, operations research, and computer science research. Basically, given a set of tasks under various constraints (required execution time, deadline, precedence among task... Feb 26 2018       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy