• Suche: "F.2.1: Numerical Algorithms and Problems"

Treffer 1 - 20 von 82

1

Instantaneous Frequency and Amplitude Estimation in Multi-Component Signals Using an EM-based Algorithm
Legros, Quentin ; Fourer, Dominique ; Meignen, Sylvain ; et al.
IEEE Transactions on Signal Processing. 72:1130-1140

ridge extraction time-frequency Bayesian estimation Expectation-Maximization... Monte Carlo sampling JEL: C - Mathematical an... …
Zeitschrift
Zu den Favoriten
2

Implementing number theoretic transforms
van der Hoeven, Joris ; Lecerf, Grégoire ; Centre National de la Recherche Scientifique (CNRS) ; et al.

number theoretic transfo... finite fields codelets algorithm complexity bound integer multiplication …
E-Ressource
Zu den Favoriten
3

Deterministic factoring with oracles
Factorisation d'entiers déterministes à l'aide d'oracles
Morain, François ; Renault, Guénaël ; Smith, Benjamin ; et al.
Applicable Algebra in Engineering. 34(4):663-690

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit... F.2.1.4: Number-theoreti... [MATH.MATH-NT]Mathematic... Number Theory [math.NT] …
Zeitschrift
Zu den Favoriten
4

Anytime search strategies for constraints satisfaction problem
Stratégies de résolution anytime de problèmes de satisfaction de contraintes numériques
Richard de Latour, Thomas ; Chenouard, Raphaël ; Granvilliers, Laurent ; et al.
Journée Francophone de la Programmation par Contrainte, Jun 2021, Nice, France

Nice, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit... ACM: G.: Mathematics of... G.1: NUMERICAL ANALYSIS …
Konferenz
Zu den Favoriten
5

Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
Aupy, Guillaume ; Herrmann, Julien ; Topology-Aware System-Scale Data Management for High-Performance Computing (TADAAM) ; et al.
Optimization Methods and Software. 32(3):594-624

Automatic differentiatio... Program reversal Adjoint computation Checkpointing Asymptotic optimality Online …
Zeitschrift
Zu den Favoriten
6

Computing Least Fixed Points of Probabilistic Systems of Polynomials
Esparza, Javier ; Gaiser, Andreas ; Kiefer, Stefan ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :359-370

Nancy, France computing fixed points numerical approximation stochastic model branching processes ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
7

Holant Problems for Regular Graphs with Complex Edge Functions
Kowalczyk, Michael ; Cai, Jin-Yi ; Department of Mathematics and Computer Science ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :525-536

Nancy, France Computational complexity ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit... [INFO.INFO-CC]Computer S... …
Konferenz
Zu den Favoriten
8

AMS Without 4-Wise Independence on Product Domains
Braverman, Vladimir ; Chung, Kai-Min ; Liu, Zhenming ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :119-130

Nancy, France Data Streams Randomized Algorithms Streaming Algorithms Independence Sketches …
Konferenz
Zu den Favoriten
9

Quantum Query Complexity of Multilinear Identity Testing
Arvind, V. ; Mukhopadhyay, Partha ; The Institue of Mathematical Sciences ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :87-98

Freiburg, Germany Quantum Algorithm Identity Testing Query Complexity Multilinear Polynomials ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
10

An $L (1/3 + \varepsilon)$ Algorithm for the Discrete Logarithm Problem for Low Degree Curves
Enge, Andreas ; Gaudry, Pierrick ; Algorithmic number theory for cryptology (TANC) ; et al.
Eurocrypt 2007. :379-393

Barcelona, Spain ACM: G.: Mathematics of... G.4: MATHEMATICAL SOFTWA... G.4.0: Algorithm design... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
11

Graph encoding of multiscale structural networks from binary images with application to bio imaging
Parisse, Nicolas ; Gourrier, Aurélien ; Genthial, Rachel ; et al.
Computer Vision Problems in Plant Phenotyping (CVPPP 2018), Sep 2018, Newcastle, United Kingdom

Newcastle, United Kingdo... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit... [INFO.INFO-TS]Computer S... Signal and Image Process... …
Konferenz
Zu den Favoriten
12

Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem
Molnár, Miklós ; Methods, Algorithms for Operations REsearch (MAORE) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
Journal of Computer and Communications. 4(14):57-79

Branch and Bound Partial Minimum Spanning... Hierarchy Multi-Constrained Steine... Quality of Service Multicast Routing …
Zeitschrift
Zu den Favoriten
13

A Distributed Information Divergence Estimation over Data Streams
Anceaume, Emmanuelle ; Busnel, Yann ; CIDER ; et al.
IEEE Transactions on Parallel and Distributed Systems. 25(2):478-487

Data stream Divergence Randomized approximation... F.2.1 Numerical Algorith... [INFO.INFO-DS]Computer S... Data Structures and Algo... …
Zeitschrift
Zu den Favoriten
14

Fast computation of all pairs of geodesic distances
Noyel, Guillaume ; Angulo, Jesus ; Jeulin, Dominique ; et al.
Image Analysis & Stereology. 30(2):101-109

geodesic propagation fast marching All pairs of geodesic di... Mathematical Morphology ACM: G.: Mathematics of... G.1: NUMERICAL ANALYSIS …
Zeitschrift
Zu den Favoriten
15

An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves
Enge, Andreas ; Gaudry, Pierrick ; Thomé, Emmanuel ; et al.
Journal of Cryptology. 24:24-41

discrete logarithm algebraic curve subexponentiality function field sieve ACM: G.: Mathematics of... G.4: MATHEMATICAL SOFTWA... …
Zeitschrift
Zu den Favoriten
16

Computing modular polynomials in quasi-linear time
Enge, Andreas ; Lithe and fast algorithmic number theory (LFANT) ; Institut de Mathématiques de Bordeaux (IMB) ; et al.
Mathematics of Computation. 78(267):1809-1824

ACM: G.: Mathematics of... G.4: MATHEMATICAL SOFTWA... G.4.0: Algorithm design... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit... …
Zeitschrift
Zu den Favoriten
17

The complexity of class polynomial computation via floating point approximations
Enge, Andreas ; Algorithmic number theory for cryptology (TANC) ; Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; et al.
Mathematics of Computation. 78(266):1089-1107

ACM: G.: Mathematics of... G.4: MATHEMATICAL SOFTWA... G.4.0: Algorithm design... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit... …
Zeitschrift
Zu den Favoriten
18

Speeding up Simplification of Polygonal Curves using Nested Approximations
Marteau, Pierre-François ; Ménier, Gildas ; Laboratoire de Recherche en Informatique et ses Applications de Vannes et Lorient (VALORIA) ; et al.
Pattern Analysis and Applications. :1-8

Polygonal Approximation Dynamic programming Multiresolution F.2.1 Numerical Algorith... [INFO.INFO-CG]Computer S... Computational Geometry [... …
Zeitschrift
Zu den Favoriten
19

Computing real solutions of polynomial fuzzy systems
Résolution réelle de systèmes polynomiaux flous
Aubry, Philippe ; Marrez, Jérémy ; Valibouze, Annick ; et al.

ACM: I.: Computing Metho... I.2: ARTIFICIAL INTELLIG... I.2.3: Deduction and The... I.2.3.8: Uncertainty, ``... I.1: SYMBOLIC AND ALGEBR... ACM: F.: Theory of Compu... …
E-Ressource
Zu den Favoriten
20

The Operator Approach to Entropy Games
Akian, Marianne ; Gaubert, Stéphane ; Grand-Clément, Julien ; et al.
Theory of Computing Systems. 63:1089-1130

FOS: Computer and inform... Policy iteration F.2.1 Numerical Algorith... [MATH.MATH-OC] Mathemati... Shapley operators policy iteration …
Fachzeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter