Showing 101 - 120 of 3,807

101

The Voronoi diagram of three lines
Everett, Hazel ; Lazard, Daniel ; Lazard, Sylvain ; et al.
Discrete and Computational Geometry. 42(1):94-130

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... [INFO.INFO-CG]Computer S...
Journal
Save to List
102

On the pathwidth of hyperbolic 3-manifolds
Sur la largeur arborescente linéaire des 3-variétés hyperboliques

Huszár, Kristóf ; Understanding the Shape of Data (DATASHAPE) ; Centre Inria d'Université Côte d'Azur ; et al.
Computing in Geometry and Topology. 1(1):1-1

computational 3-manifold... fixed-parameter tractabi... generalized Heegaard spl... pathwidth treewidth hyperbolic 3-manifolds
Journal
Save to List
103

Efficient Sampling of Random Permutations
Gustedt, Jens ; Algorithms for the Grid (ALGORILLE) ; INRIA Lorraine ; et al.
Journal of Discrete Algorithms. 6(1):125-139

random permutations random shuffling coarse grained paralleli... external memory algorith... uniformly generated comm... ACM: F.: Theory of Compu...
Journal
Save to List
104

Line transversals to disjoint balls
Borcea, Ciprian ; Goaoc, Xavier ; Petitjean, Sylvain ; et al.
Discrete and Computational Geometry. 39(1-3):158-173

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... Computational Geometry [...
Journal
Save to List
105

Near-Optimal Parameterization of the Intersection of Quadrics: I. The Generic Algorithm
Dupont, Laurent ; Lazard, Daniel ; Lazard, Sylvain ; et al.
Journal of Symbolic Computation. 43(3):168-191

curve parameterization pencils of quadrics quadrics Intersection of surfaces ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Journal
Save to List
106

Beeping a Deterministic Time-Optimal Leader Election
Dufoulon, Fabien ; Burman, Janna ; Beauquier, Joffroy ; et al.
[Research Report] LRI, Université Paris-Sud, CNRS, Université Paris-Saclay. 2018

distributed algorithms leader election beeping model time complexity deterministic algorithms wireless networks
Report
Save to List
107

Topology, homogeneity and scale factors for object detection: application of eCognition software for urban mapping using multispectral satellite image
Lemenkova, Polina ; Ocean University of China (OUC)
7th International Scientific and Practical Conference 'Internet and Society. Modeling'. INSO2015., Jul 2015, Kutaisi, Georgia

Kutaisi, Georgia ACM: I.: Computing Metho... I.4: IMAGE PROCESSING AN... I.4.1: Digitization and... I.4.1.1: Imaging geometr... I.4.3: Enhancement
Conference
Save to List
108

Building Efficient and Compact Data Structures for Simplicial Complexes
Boissonnat, Jean-Daniel ; Karthik, C. S. ; Tavenas, Sébastien ; et al.

Eindhoven, Netherlands compact data structures Simplicial complex automaton NP-hard ACM: F.: Theory of Compu...
Conference
Save to List
109

Multiseed Lossless Filtration
Kucherov, Gregory ; Noé, Laurent ; Roytberg, Mikhail, A. ; et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2(1):51-61

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.3: Pattern matchin... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC...
Journal
Save to List
110

Extremal Properties of Three Dimensional Sensor Networks with Applications
Ravelomanana, Vlady ; Laboratoire d'Informatique de Paris-Nord (LIPN) ; Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)
IEEE Transactions on Mobile Computing. :246-257

hop-diameter minimum maximum degrees transmitting sensing ranges analytical methods
Journal
Save to List
111

Expected Size of the 3-Dimensional Delaunay Triangulation of Random Points on a Surface
Taille moyenne de la triangulation 3D de Delaunay de points aléatoirement distribués sur une surface

Duménil, Charles ; Geometric Algorithms and Models Beyond the Linear and Euclidean realm (GAMBLE) ; Centre Inria de l'Université de Lorraine ; et al.
Computational Geometry [cs.CG]. Université de Lorraine, 2022. English. ⟨NNT : 2022LORR0050⟩

Computational geometry Empty Region Graph Poisson Point Process Generic Surface 3D-Delaunay Triangulatio... Géométrie algorithmique...
Dissertation/ Thesis
Save to List
112

Computing Persistent Homology with Various Coefficient Fields in a Single Pass
Boissonnat, Jean-Daniel ; Maria, Clément ; Geometric computing (GEOMETRICA) ; et al.
European Symposium on Algorithms, European Association for Theoretical Computer Science (EATCS), Sep 2014, Wrocław, Poland

Wrocław, Poland Computational Topology P... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro...
Conference
Save to List
113

The Maximum Degree of a Random Delaunay Triangulation in a Smooth Convex
Broutin, Nicolas ; Devillers, Olivier ; Hemsley, Ross ; et al.
AofA 2014 - 25th International Conference on Probabilistic. Algorithms(2014)

Paris, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-DS]Computer S...
Conference
Save to List
114

Efficiently Navigating a Random Delaunay Triangulation
Broutin, Nicolas ; Devillers, Olivier ; Hemsley, Ross ; et al.

Paris, France Delaunay Triangulation Randomised Analysis Point Location Routing ACM: F.: Theory of Compu...
Conference
Save to List
115

Algorithmic Complexity of Well-Quasi-Orders
Complexité algorithmique des beaux pré-ordres

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.
Logic in Computer Science [cs.LO]. École normale supérieure Paris-Saclay, 2017

Well-quasi-order infinite-state system fast-growing complexity vector addition system Petri net système infini
Report
Save to List
116

Algorithms for the Bin Packing Problem with Overlapping Items
Grange, Aristide ; Kacem, Imed ; Martin, Sébastien ; et al.

Virtual-Machine Packing Integer linear programmi... Heuristics Bin packing Pagination Genetic algorithms
Electronic Resource
Save to List
117

Carpooling : the 2 Synchronization Points Shortest Paths Problem
Bit-Monnot, Arthur ; Artigues, Christian ; Huguet, Marie-José ; et al.
13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), Sep 2013, Sophia Antipolis, France. 12 p, ⟨10.4230/OASIcs.ATMOS.2013.150⟩

Sophia Antipolis, France Dynamic Carpooling Shortest Path Problem Synchronized Paths 'G.2.1 Combinatorics', '... [INFO.INFO-RO]Computer S...
Conference
Save to List
118

Foundation for a series of efficient simulation algorithms
Cécé, Gérard ; Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST) ; Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC) ; et al.

Simulation efficient algorithms preorders Kripke structures ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Electronic Resource
Save to List
119

Tight Kernels for Covering with Points and Polynomials
Boissonnat, Jean-Daniel ; Dutta, Kunal ; Ghosh, Arijit ; et al.

Nonnumerical Algorithms... Incidence Geometry Tight Kernel Lower bound... Hyperplanes Bounded Degree polynomials
Electronic Resource
Save to List
120

ImproteK: introducing scenarios into human-computer music improvisation
Nika, Jérôme ; Chemillier, Marc ; Assayag, Gérard ; et al.
ACM Computers in Entertainment, 2017, ⟨10.1145/3022635⟩

Planning under uncertain... Symbolic and algebraic a... Motif discovery Heuristic function const... Markov processes Combinatorics on words
Journal
Save to List

Filter