• Suche: "ACM: G.: Mathematics of Computing"

Treffer 181 - 200 von 1.951

181

POLYDENDRIFORM STRUCTURE ON FACES OF HYPERGRAPH POLYTOPES
Delcroix-Oger, Bérénice ; Curien, Pierre-Louis ; Obradović, Jovana ; et al.

ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.1: Combinatorics [INFO.INFO-DM]Computer S... Discrete Mathematics [cs... [MATH.MATH-CO]Mathematic... …
E-Ressource
Zu den Favoriten
183

Advanced reduced-order models for moisture diffusion in porous media
Gasparin, Suelen ; Berger, Julien ; Dutykh, Denys ; et al.
Transport in Porous Media. 124(3):965-994

spectral methods moisture diffusion Proper Generalised Decom... reduced-order modelling numerical methods 35R30 (primary), 35K05,... …
Zeitschrift
Zu den Favoriten
184

Robust Basic Cyclic Scheduling Problem
Hamaz, Idir ; Houssin, Laurent ; Cafieri, Sonia ; et al.
EURO Journal on Computational Optimization. 6(3):291-313

ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.1: Combinatorics G.2.1.0: Combinatorial a... G.2.2: Graph Theory G.2.2.0: Graph algorithm... …
Zeitschrift
Zu den Favoriten
185

Object digitization up to a translation
Discrétisations modulo le groupe des translations
Mazo, Loïc ; Baudrier, Étienne ; Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube) ; et al.
Journal of Computer and System Sciences. 95:193-203

digitization plane curve translation dual representation ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Zeitschrift
Zu den Favoriten
186

Relationship between superstring and compression measures: New insights on the greedy conjecture
Cazaux, Bastien ; Rivals, Eric ; Méthodes et Algorithmes pour la Bioinformatique (MAB) ; et al.
Discrete Applied Mathematics. 245:59-64

Approximation algorithm Shortest Common Superstr... Stringology Data compression Assembly Greedy conjecture …
Zeitschrift
Zu den Favoriten
187

Multigraphs without large bonds are wqo by contraction
Kamiński, Marcin, Jakub ; Raymond, Jean-Florent ; Trunck, Théophile ; et al.
Journal of Graph Theory. 88(4):558-565

Well-quasi-ordering Graph decomposition Structural graph theory ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.1: Combinatorics …
Zeitschrift
Zu den Favoriten
188

BRANE Clust: Cluster-Assisted Gene Regulatory Network Inference Refinement
Pirayre, Aurélie ; Couprie, Camille ; Duval, Laurent ; et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics. 15(3):850-860

Transcriptomic data Combinatorial optimizati... network inference Graph Clustering Gene regulation network DREAM Challenge …
Zeitschrift
Zu den Favoriten
189

Zentralitätsmaßnahmen für die Evakuierung: so finden Sie agile Evakuierungsrouten
Centrality measures for evacuation: Finding agile evacuation routes
Medidas de centralidad para la evacuación. Cómo encontrar rutas de evacuación ágil
Mesures de centralité pour l'évacuation: comment trouver des itinéraires d'évacuation agiles
Misure di centralita per l'evacuazione. Come trovare percorsi di evacuazione agili
Lujak, Marin ; Giordani, Stefano ; Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Lille Douai) ; et al.
Future Generation Computer Systems. 83:401-412

ACM: I.: Computing Metho... I.2: ARTIFICIAL INTELLIG... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Zeitschrift
Zu den Favoriten
190

Malleable task-graph scheduling with a practical speed-up model
Marchal, Loris ; Simon, Bertrand ; Sinnen, Oliver ; et al.
IEEE Transactions on Parallel and Distributed Systems. 29(6):1357-1370

malleable tasks task graph Scheduling proportional mapping approximation algorithms speedup model …
Zeitschrift
Zu den Favoriten
191

An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$
Chatzidimitriou, Dimitris ; Raymond, Jean-Florent ; Sau, Ignasi ; et al.
Algorithmica. 80(4):1330-1356

Protrusion decomposition Minor-models of θ Coverings in graph Erdős–Pósa property Approximation algorithm Packings in graphs …
Zeitschrift
Zu den Favoriten
192

Conferences WORDS, years 1997-2017: Open Problems and Conjectures
Néraud, Jean ; Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS) ; Université Le Havre Normandie (ULH) ; et al.
Bulletin of Association for Theoretical Computer Science (BEATCS). 125:119-148

MSC 68R15 ACM: F.: Theory of Compu... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... [INFO.INFO-CL]Computer S... Computation and Language... …
Zeitschrift
Zu den Favoriten
193

Algorithms for Computing Cubatures Based on Moment Theory
Collowald, Mathieu ; Hubert, Evelyne ; Géométrie , Algèbre, Algorithmes (GALAAD2) ; et al.
Studies in Applied Mathematics. 141(4):501-546

Hankel Matrices Cubatures Gaussian Quadrature ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... ACM: G.: Mathematics of... …
Zeitschrift
Zu den Favoriten
194

Front shape similarity measure for shape-oriented sensitivity analysis and data assimilation for Eikonal equation
Rochoux, Mélanie ; Collin, Annabelle ; Zhang, Cong ; et al.
ESAIM: Proceedings and Surveys. :258-279

ACM: G.: Mathematics of... G.1: NUMERICAL ANALYSIS G.1.8: Partial Different... G.1.8.5: Hyperbolic equa... G.1.8.6: Inverse problem... ACM: I.: Computing Metho... …
Zeitschrift
Zu den Favoriten
195

On the error estimates of the vector penalty-projection methods: Second-order scheme
Angot, Philippe ; Cheaytou, Rima ; Institut de Mathématiques de Marseille (I2M) ; et al.
Mathematics of Computation. 87(313):2159-2187

2010 Mathematics Subject... ACM: G.: Mathematics of... G.1: NUMERICAL ANALYSIS [MATH.MATH-NA]Mathematic... Numerical Analysis [math... [MATH.MATH-AP]Mathematic... …
Zeitschrift
Zu den Favoriten
196

Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots
Balabonski, Thibaut ; Courtieu, Pierre ; Pelle, Robin ; et al.
[Research Report] Sorbonne Université. :1-12

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... ACM: D.: Software D.1: PROGRAMMING TECHNIQ... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Zu den Favoriten
197

Periodic Pólya urns and an application to Young tableaux
Banderier, Cyril ; Marchal, Philippe ; Wallner, Michael ; et al.
Leibniz International Proceedings in Informatics. :1-12

Mittag-Leffler distribut... generalized Gamma distri... hypergeometric function Pólya urn generating functions Young tableau …
Zeitschrift
Zu den Favoriten
198

Fast, generic and reliable control and simulation of soft robots using model order reduction
Goury, Olivier ; Duriez, Christian ; Deformable Robots Simulation Team (DEFROST) ; et al.
IEEE Transactions on Robotics. 34(6):1565-1576

Proper Orthogonal Decomp... Model Order Reduction Robot simulation Soft Robotics Hyperreduction Energy conserving sampli... …
Zeitschrift
Zu den Favoriten
199

The Tower Number Field Sieve
Barbulescu, Razvan ; Gaudry, Pierrick ; Kleinjung, Thorsten ; et al.
ASIACRYPT 2015. :31-58

Auckland, New Zealand discrete logarithm number field sieve pairings ACM: G.: Mathematics of... [INFO.INFO-CR]Computer S... …
Konferenz
Zu den Favoriten
200

Newton series, coinductively
Basold, Henning ; Hansen, Helle Hvid ; Pin, Jean-Eric ; et al.
ICTAC 2015. 9399(2015):91-109

Cali, Colombia Newton series coalgebra weighted language shuffle product infiltration product …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter