Showing 161 - 180 of 321

161

Deterministic Regular Expressions in Linear Time
Groz, Benoit ; Maneth, Sebastian ; Staworko, Slawomir ; et al.
PODS-31th ACM Symposium on Principles of Database Systems. :12-12

Scottsdale, United State... DTD XML SChema Deterministic Regular Ex... Glushkov Automaton Linear time
Conference
Save to List
162

Speedup character-based matching in learning classifier systems with Xor
Enée, Gilles ; Peroumalnaïk, Mathias ; Laboratoire de Mathématiques Informatique et Applications (LAMIA) ; et al.
Genetic And Evolutionary Computation Conference. :1879-1884

Portland, Oregon, United... learning classifier syst... matching algorithm F.2.2 Nonnumerical Algor... [INFO.INFO-CC]Computer S... Computational Complexity...
Conference
Save to List
163

Engineering Parallel In-Place Random Generation of Integer Permutations
Gustedt, Jens ; Algorithms for the Grid (ALGORILLE) ; INRIA Lorraine ; et al.
International Workshop on Experimental Algorithms. :129-141

Provincetown, MA, United... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.1: Computations on... ACM: G.: Mathematics of...
Conference
Save to List
164

Implicational Relevance Logic is 2-ExpTime-Complete
Schmitz, Sylvain ; Laboratoire Spécification et Vérification [Cachan] (LSV) ; École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS) ; et al.
The Journal of Symbolic Logic. 81(2):641-661

relevance logic branching VASS focusing proofs complexity ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC...
Journal
Save to List
165

Computing the Distance between Piecewise-Linear Bivariate Functions
Moroz, Guillaume ; Aronov, Boris ; Effective Geometric Algorithms for Surfaces and Visibility (VEGAS) ; et al.
ACM Transactions on Algorithms. 12(1):3-3

polyhedral terrain multipoint evaluation piecewise-linearfunction ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Journal
Save to List
166
167

Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice
Algorithmes Exacts Avec Garantie au Pire Cas Pour l'Ordonnancement: de la Théorie à la Pratique

Shang, Lei ; Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT) ; Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL) ; et al.
Computational Complexity [cs.CC]. Université François Rableais deTours, 2017. English. ⟨NNT : ⟩

branch and reduce total tardiness dynamic programming memorization scheduling Exact exponential algori...
Dissertation/ Thesis
Save to List
168

Non-Elementary Complexities for Branching VASS, MELL, and Extensions
Lazić, Ranko ; Schmitz, Sylvain ; University of Warwick [Coventry] ; et al.
ACM Transactions on Computational Logic. :1-30

fast-growing complexity linear logic vector addition systems ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Journal
Save to List
169

Extraction and classification of dense implicit communities in the Web graph
Dourisboure Y ; Geraci F ; Pellegrini M
ACM transactions on the web 3 (2009). doi:10.1145/1513876.1513879
info:cnr-pdr/source/autori:Dourisboure Y.; Geraci F.; Pellegrini M./titolo:Extraction and classification of dense implicit communities in the Web Graph/doi:10.1145%2F1513876.1513879/rivista:ACM transactions on the web/anno:2009/pagina_da:/pagina_a:/intervallo_pagine:/volume:3

communities H.2.8 Database applicati... web graph detection of dense subgr... 0202 electrical engineer... 02 engineering and techn...
Academic journal
Save to List
170

Stateless Reliable Geocasting
Adamek, Jordan ; Nesterenko, Mikhail ; Robinson, James Scott ; et al.
36th IEEE Symposium on Reliable Distributed Systems (SRDS 2017), Sep 2017, Hong Kong, China

Hong Kong, China ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.2: Network Protocols C.2.4: Distributed Syste... ACM: F.: Theory of Compu...
Conference
Save to List
171

Form item extraction based on line searching
Turolla, Eric ; Belaïd, Yolande ; Belaïd, Abdel ; et al.
International Workshop on Graphics Recognition - GRCE. :69-79

University Park, PA, Uni... Hough Transform Line Searching Item Extraction Form Analysis ACM: I.: Computing Metho...
Conference
Save to List
172

Enumeration and numeration
Énumération et numération

Marsault, Victor ; Laboratoire Traitement et Communication de l'Information (LTCI) ; Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS) ; et al.
Mathématique discrète [cs.DM]. Télécom ParisTech, 2016. Français. ⟨NNT : 2016ENST0017⟩

Automata Numeration systems Integer base Rational base Abstract numeration syst... Periodic sets
Dissertation/ Thesis
Save to List
173

Anisotropic Delaunay Mesh Generation
Boissonnat, Jean-Daniel ; Wormser, Camille ; Yvinec, Mariette ; et al.
[Research Report] RR-7712. :50-50

Delaunay triangulation anisotropic meshes mesh generation ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Report
Save to List
174

Structure and Stability of the 1-Dimensional Mapper
Carriere, Mathieu ; Oudot, Steve ; Understanding the Shape of Data (DATASHAPE) ; et al.

Boston, United States ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... [MATH.MATH-AT]Mathematic... Algebraic Topology [math...
Conference
Save to List
175

Counting and generating lambda terms
Lescanne, Pierre ; Grygiel, Katarzyna ; Laboratoire de l'Informatique du Parallélisme (LIP) ; et al.
Journal of Functional Programming. 23(05):594-628

lambda calculus combinatorics functional programming test random generator ranking
Journal
Save to List
176

On the Complexity of the Generalized MinRank Problem
Faugère, Jean-Charles ; Safey El Din, Mohab ; Spaenlehauer, Pierre-Jean ; et al.
Journal of Symbolic Computation. 55:30-58

ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... I.1.2: Algorithms I.1.2.0: Algebraic algor... I.1.2.1: Analysis of alg... ACM: F.: Theory of Compu...
Journal
Save to List
177

Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
Haviv, Ishay ; Regev, Oded ; School of Computer Science (TAU-CS) ; et al.
Theory of Computing. 8(1):513-531

hardness of approximatio... NP-hardness shortest vector problem lattices ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Journal
Save to List
178

Zigzag Zoology: Rips Zigzags for Homology Inference
Oudot, Steve ; Sheehy, Donald ; Geometric computing (GEOMETRICA) ; et al.
[Research Report] RR-8141. :48-48

Zigzag persistence homology inference Rips filtrations applied topology ACM: I.: Computing Metho... I.3: COMPUTER GRAPHICS
Report
Save to List
179

Farthest-Polygon Voronoi Diagrams
Cheong, Otfried ; Everett, Hazel ; Glisse, Marc ; et al.
Computational Geometry. 44(4):14-14

polygon Voronoi diagram computational geometry ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Journal
Save to List
180

Precise Evaluation of the Efficiency and the Robustness of Stochastic DAG Schedules
Canon, Louis-Claude ; Jeannot, Emmanuel ; Algorithms for the Grid (ALGORILLE) ; et al.
[Research Report] RR-6895. :22-22

Stochastic DAG Random Variable Max+ Correlation ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Report
Save to List

Filter