Search Results - Complexity of computation (including implicit computational complexity)

Recent advances in real complexity and computation : UIMP-RSME Lluís A. Santaló Summer School, recent advances in real complexity and computation, July 16-20, 2012, Universidad Internacional Menéndez Pelayo, Santander, Spain by UIMP-RSME Santaló Summer School, Montana, Jose Luis, Pardo, L. M. (Luis M.)

“…This volume is composed of six contributions derived from the lectures given during the UIMP-RSME Lluis Santalo Summer School on ""Recent Advances in Real Complexity and Computation'', held July 16-20…”
Get full text

A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations by Bournez, Olivier, Durand, Arnaud

“… We present the general theory of discrete ODEs for computation theory, we illustrate this with various examples of algorithms, and we provide several implicit characterizations of complexity and computability classes…”
Get full text

Hidden Markov Model and multifractal method-based predictive quantization complexity models vis-á-vis the differential prognosis and differentiation of Multiple Sclerosis’ subgroups by Karaca, Yeliz, Baleanu, Dumitru, Karabudak, Rana

“…Hidden Markov Model (HMM) is a stochastic process where implicit or latent stochastic processes can be inferred indirectly through a sequence of observed states…”
Get full text

Proximity Queries Between Convex Objects: An Interior Point Approach for Implicit Surfaces by Chakraborty, N., Jufeng Peng, Akella, S., Mitchell, J.E.

“…This paper presents a general method for exact distance computation between convex objects represented as intersections of implicit surfaces…”
Get full text

Weighted automata and logics meet computational complexity by Kostolányi, Peter

“… The article surveys these too-little-known connexions implicit in the existing literature and suggests a systematic approach to the study of weighted complexity classes. An extension of SAT to weighted propositional logic is proved to be complete for NP[S] when S is finitely generated. Moreover, a class FP[S] is introduced for each semiring S as a counterpart to P, and the relations between FP[S] and NP[S] are considered…”
Get full text

Low-Computational-Complexity Zeroing Neural Network Model for Solving Systems of Dynamic Nonlinear Equations by Zheng, Kangze, Li, Shuai, Zhang, Yunong

“… One of them is explicit, involving the computation of a pseudoinverse matrix, and the other is of implicit dynamics essentially…”
Get full text

INR-Arch: A Dataflow Architecture and Compiler for Arbitrary-Order Gradient Computations in Implicit Neural Representation Processing by Abi-Karam, Stefan, Sarkar, Rishov, Xu, Dejia, Fan, Zhiwen, Wang, Zhangyang, Hao, Cong

“…An increasing number of researchers are finding use for nth-order gradient computations for a wide variety of applications, including graphics, meta-learning (MAML…”
Get full text

Level set function–based immersed interface method and benchmark solutions for fluid flexible‐structure interaction by Thekkethil, Namshad, Sharma, Atul

“…‐iterative partitioned method–based fully implicit coupling between the two solvers. The novelty of the proposed method is a level set function…”
Get full text

Application of the Multiplicative Regularized Gauss-Newton Algorithm for Three-Dimensional Microwave Imaging by Abubakar, A., Habashy, T. M., Guangdong Pan, Mao-Kun Li

“… edge-preserving characteristics. In addition, in order to deal with an extensive memory requirement for the Gauss-Newton method, we employ an implicit Jacobian calculation scheme…”
Get full text

Finite volume method analysis of heat transfer problem using adapted strongly implicit procedure by Rouboa, Abel, Monteiro, Eliseu, de Almeida, Regina

“… The multi-block grid technique allows artificially reducing the complexity of the geometry by breaking down the real domain into a number of sub-domains with simpler geometry…”
Get full text

Multiphysical approach including equivalent circuit models for the sizing by optimization by Baraston, Arnaud, Gerbaud, Laurent, Reinbold, Vincent, Boussey, Thomas, Wurtz, Frédéric

“… The coupling of such models with other models is difficult to take into account, partly because it adds complexity to the process…”
Get full text

Disjunctive closures for knowledge compilation by Fargier, Hélène, Marquis, Pierre

“… When no class of propositional representations offers all the transformations one would expect, some of them can be left implicit…”
Get full text

iNL: Implicit non-local network by Han, Yifeng, Chen, Xi, Zhang, Songjie, Qi, Donglian

“… In this way, the computation complexity and the memory costs are reduced. In addition, we take a further step and extend our iNL into a more…”
Get full text

CMSA: a heterogeneous CPU/GPU computing system for multiple similar RNA/DNA sequence alignment by Chen, Xi, Wang, Chen, Tang, Shanjiang, Yu, Ce, Zou, Quan

“… Although there are a lot of work on MSA problems, their approaches are either insufficient or contain some implicit assumptions that limit the generality of usage…”
Get full text

Stress resultant plasticity for shells revisited by Dujc, Jaka, Brank, Boštjan

“…–Shapiro two-surface yield function with isotropic and kinematic hardening. The main focus is on implicit projection algorithms for computation of updated values of internal variables for stress resultant shell elastoplasticity…”
Get full text

AlcoR: alignment-free simulation, mapping, and visualization of low-complexity regions in biological data by Silva, Jorge M, Qi, Weihong, Pinho, Armando J, Pratas, Diogo

“…Abstract Background Low-complexity data analysis is the area that addresses the search and quantification of regions in sequences of elements that contain low-complexity or repetitive elements…”
Get full text

Compact Formulae in Sparse Elimination by Emiris, Ioannis

“… This talk surveys compact formulae, including older and recent results, in sparse elimination…”
Get full text

SPLMax: Exploiting the Simple Path Introduced Locality for Maximum Flow Acceleration by Wei, Wei, Liu, Yang, Zhang, Ruqing

“… The simple path introduced locality is implicit in classic max-flow algorithms, i.e., only the vertices in simple paths between source and sink are involved in max-flow calculation…”
Get full text

A space-time high-order implicit shock tracking method for shock-dominated unsteady flows by Naudet, Charles J, Zahr, Matthew J

“…High-order implicit shock tracking (fitting) is a class of high-order, optimization-based numerical methods to approximate solutions of conservation laws…”
Get full text

Algorithms by design with illustrations to solid and structural mechanics/dynamics by Zhou, X., Tamma, K. K.

“… of computational mechanics, but with focus on solid and structural mechanics/dynamics as an illustration…”
Get full text