• Suche: "Nonnumerical algorithms"

Treffer 81 - 100 von 4.040

81

On the complexity of the F5 Gröbner basis algorithm
Bardet, Magali ; Faugère, Jean-Charles ; Salvy, Bruno ; et al.
Journal of Symbolic Computation. 70:49-70

Gröbner bases Regular Sequences Noether Position F5 algorithm Complexity ACM: F.: Theory of Compu... …
Zeitschrift
Zu den Favoriten
82

Towards a Realistic Analysis of Some Popular Sorting Algorithms
Clément, Julien ; Nguyen Thi, Thu Hien ; Vallée, Brigitte ; et al.
Combinatorics. 24(01):104-144

Primary 68W32, 68P10, 68... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.6: Sorting and sea... [INFO.INFO-DS]Computer S... …
Zeitschrift
Zu den Favoriten
83

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs
Antunes, Daniel ; Mathieu, Claire ; Mustafa, Nabil ; et al.
25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. ⟨10.4230/LIPIcs.ESA.2017.8⟩

Vienna, Austria Combinatorial Optimizati... Expansion Hall's Theorem Local Search Planar Graphs …
Konferenz
Zu den Favoriten
84

Kernelization of the Subset General Position problem in Geometry
Boissonnat, Jean-Daniel ; Dutta, Kunal ; Ghosh, Arijit ; et al.
MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Alborg, Denmark. ⟨10.4230/LIPIcs.MFCS.2017.25⟩

Alborg, Denmark Kernel Lower bounds Incidence Geometry Hyperplanes Bounded degree polynomia... ACM Subject Classificati... …
Konferenz
Zu den Favoriten
85

Fine-grained complexity of coloring unit disks and balls
Biró, Csaba ; Bonnet, Edouard ; Marx, Dániel ; et al.

Brisbane, Australia ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
86

Local Equivalence and Intrinsic Metrics Between Reeb Graphs
Carriere, Mathieu ; Oudot, Steve Y. ; Understanding the Shape of Data (DATASHAPE) ; et al.
International Symposium on Computational Geometry, Jul 2017, Brisbane, Australia

Brisbane, Australia Topological Data Induced Metrics Analysis Reeb Graphs ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
87

An Efficient Representation for Filtrations of Simplicial Complexes
Boissonnat, Jean-Daniel ; Srikanta, Karthik C. ; Understanding the Shape of Data (DATASHAPE) ; et al.
Symposium on Discrete Algorithms SODA 2017, Jan 2017, Barcelona, France

Barcelona, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... F.2.2.1: Computations on... …
Konferenz
Zu den Favoriten
88

High-dimensional approximate r-nets
Avarikioti, Georgia ; Emiris, Ioannis Z. ; Kavouras, Loukas ; et al.
SODA: ACM/SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelone, Spain

Barcelone, Spain Locality-sensitive hashi... r-nets Approximation algorithms High dimension Metric geometry …
Konferenz
Zu den Favoriten
89

Regular Separability of Parikh Automata
Clemente, Lorenzo ; Czerwiński, Wojciech ; Lasota, Sławomir ; et al.

Varsovie, Poland separability problem Parikh automata integer vector addition... visible one counter auto... decidability …
Konferenz
Zu den Favoriten
90

Faster Graph Coloring in Polynomial Space
Gaspers, Serge ; Lee, Edward J.
Algorithmica. 85(2):584-609

Fachzeitschrift
Zu den Favoriten
91

Proof-theoretic aspects of the logic of scope
Moot, Richard ; Exploration et exploitation de données textuelles (LIRMM ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
ISSN: 0925-8531.

Type-logical grammars Proof theory Proof nets Parsing as deduction ACM: F.: Theory of Compu... ACM: F.: Theory of Compu... …
Fachzeitschrift
Zu den Favoriten
92

Delaunay Stability via Perturbations
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
International Journal of Computational Geometry and Applications. 24:125-152

perturbation stability Delaunay triangulation ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Zeitschrift
Zu den Favoriten
93

Nonnumerical Algorithms and Problems—Sequencing
Guillaume Aupy ; Anne Benoit ; Fanny Dufossé ; et al.
http://hal-ens-lyon.archives-ouvertes.fr/docs/00/85/72/68/PDF/spaa48a-benoit.pdf.

complexity bi-criteria optimization algorithms scheduling
Fachzeitschrift
Zu den Favoriten
94

The stability of Delaunay triangulations
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
International Journal of Computational Geometry and Applications. 23(4-5):303-333

Delaunay triangulation s... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-CG]Computer S... …
Zeitschrift
Zu den Favoriten
95

The Multiple Number Field Sieve for Medium and High Characteristic Finite Fields
Barbulescu, Razvan ; Pierrot, Cécile ; Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) ; et al.
LMS Journal of Computation and Mathematics. 17:230-246

Discrete logarithm probl... finite fields number field sieve ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Zeitschrift
Zu den Favoriten
96

Discretized Riemannian Delaunay triangulations
Rouxel-Labbé, Maël ; Wintraecken, M ; Boissonnat, J.-D ; et al.

Washington DC, United St... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-CG]Computer S... …
Konferenz
Zu den Favoriten
97

On the Voting Time of the Deterministic Majority Process
Kaaser, Dominik ; Mallmann-Trenn, Frederik ; Natale, Emanuele ; et al.
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Aug 2016, Krakow, Poland. ⟨10.4230/LIPIcs.MFCS.2016.55⟩

Krakow, Poland majority rule distributed voting ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Konferenz
Zu den Favoriten
98

Bounds on the Voter Model in Dynamic Networks
Berenbrink, Petra ; Giakkoupis, George ; Kermarrec, Anne-Marie ; et al.

Rome, Italy Voting Distributed Computing Conductance Dynamic Graphs Consensus …
Konferenz
Zu den Favoriten
99

Longest Common Substring with Approximately k Mismatches
Starikovskaya, Tatiana ; Département d'informatique - ENS-PSL (DI-ENS) ; École normale supérieure - Paris (ENS-PSL) ; et al.
27th Annual Symposium on Combinatorial Pattern Matching CPM 2016, 2016, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2016.21⟩

Warsaw, Poland 1998 ACM Subject Classif... string similarity measur... longest common substring sketching locality-sensitive hashi... …
Konferenz
Zu den Favoriten
100

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem: Dynamic programming approach to the generalized minimum Manhattan network problem
Yuya Masumura ; Taihei Oki ; Yutaro Yamaguchi
Lecture Notes in Computer Science ISBN: 9783030532611

dynamic programming FOS: Computer and inform... Combinatorial optimizati... 0102 computer and inform... Dynamic programming 01 natural sciences …
Fachzeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter