• Suche: "Nonnumerical algorithms"

Treffer 141 - 160 von 3.806

141

A probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.

Delaunay complex witness complex relaxed Delaunay complex distance and incircle pr... simplex quality Lovàsz local lemma …
E-Ressource
Zu den Favoriten
142

Randomized Initialization of a Wireless Multihop Network
Ravelomanana, Vlady

Computer Science - Distr... Computer Science - Discr... ACM Classification: C.2.... F.2.2 Nonnumerical algor... G.3 Probability and stat...
Report
Zu den Favoriten
143

Fast Parallel Graph-Search with Splittable and Catenable Frontiers
Acar, Umut A. ; Charguéraud, Arthur ; Rainey, Mike ; et al.
[Technical Report] Inria. 2015

ACM: C.: Computer System... C.1: PROCESSOR ARCHITECT... C.1.4: Parallel Architec... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Report
Zu den Favoriten
144

Packet Efficient Implementation of the Omega Failure Detector
Bramas, Quentin ; Foreback, Dianne ; Nesterenko, Mikhail ; et al.
[Research Report] UPMC Université Paris VI; Kent State University. 2015

impossibility result packet efficiency distributed algorithm Failure detector ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Zu den Favoriten
145

Complexity of Token Swapping and its Variants
Bonnet, Edouard ; Miltzow, Tillmann ; Rzążewski, Paweł ; et al.
34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017). :16-16

Hanovre, Germany token swapping parameterized complexity NP-hardness ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
146

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF
Olaf Beyersdorff ; Joshua Blinkhorn ; Leroy Chew ; et al.
J Autom Reason
Beyersdorff, O, Blinkhorn, J, Leroy Chew, Schmidt, R & Suda, M 2018, 'Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF', Journal of Automated Reasoning, vol. 63, no. 0, pp. 597–623. https://doi.org/10.1007/s10817-018-9482-4
Journal of Automated Reasoning

Dependency schemes 0202 electrical engineer... DQBF Quantified Boolean formu... 0102 computer and inform... 02 engineering and techn... …
Fachzeitschrift
Zu den Favoriten
147

Only distances are required to reconstruct submanifolds
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
[Research Report] INRIA Sophia Antipolis. 2014

Witness complex power protection sampling manifold reconstruction ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Zu den Favoriten
148

On the complexity of the representation of simplicial complexes by trees
De la difficulté de représenter des complexes simpliciaux par des arbres
Boissonnat, Jean-Daniel ; Mazauric, Dorian ; Geometric computing (GEOMETRICA) ; et al.
[Research Report] RR-8647, Inria Sophia Antipolis; INRIA. 2014

tree representations approximation algorithms NP-complete simplicial complexes hypergraphs ACM: F.: Theory of Compu... …
Report
Zu den Favoriten
149

Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm
Balabonski, Thibaut ; Delga, Amélie ; Rieg, Lionel ; et al.
International Symposium on Stabilization. :7-19

Lyon, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.1: Computations on... F.2.2.0: Complexity of p... …
Konferenz
Zu den Favoriten
150

Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper)
Bramas, Quentin ; Tixeuil, Sébastien ; Networks and Performance Analysis (NPA) ; et al.
International Symposium on Stabilization. :88-93

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

Parameterized Hardness of Art Gallery Problems
Bonnet, Edouard ; Miltzow, Tillmann ; Computer and Automation Research Institute [Budapest] (MTA SZTAKI )
24th European Symposium on Algorithms (ESA 2016). :19-19

Aarhus, Denmark ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... [INFO.INFO-CC]Computer S... Computational Complexity... …
Konferenz
Zu den Favoriten
152

Degree four plane spanners: Simpler and better
Kanj, Iyad ; Perkovic, Ljubomir ; Türkoglu, Duru ; et al.
Journal of Computational Geometry. 8(2):3-31

Computational Geometry (... FOS: Computer and inform... 4. Education 1. No poverty Computer Science - Compu... F.2.2, I.3.5 …
Fachzeitschrift
Zu den Favoriten
153

Solving the Traffic and Flitter Challenges with Tulip
Simonetto, Paolo ; Koenig, Pierre-Yves ; Zaidi, Faraz ; et al.
IEEE Symposium on Visual Analytics Science and Technology 2009. :247-248

Atlantic City, New Jerse... H.5.0 [Information Syste... [INFO.INFO-IR]Computer S... Information Retrieval [c...
Konferenz
Zu den Favoriten
154

Decomposition of multihomogeneous polynomials: minimal number of variables
Berthomieu, Jérémy ; Polynomial Systems (PolSys) ; Laboratoire d'Informatique de Paris 6 (LIP6) ; et al.

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-SC]Computer S... Symbolic Computation [cs... …
E-Ressource
Zu den Favoriten
155

A probabilistic algorithm to compute the real dimension of a semi-algebraic set
Safey El Din, Mohab ; Tsigaridas, Elias ; Polynomial Systems (PolSys) ; et al.

symbolic computation complexity Effective real algebraic... real dimension ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... …
E-Ressource
Zu den Favoriten
156

A constraint hierarchies approach to geometric constraints on sketches
Jermann, Christophe ; Hosobe, Hiroshi ; Laboratoire d'Informatique de Nantes Atlantique (LINA) ; et al.
Symposium on Applied Computing. :1843-1844

geometric constraints preferences decomposition ACM F.2.2 Nonnumerical A... [INFO.INFO-AI]Computer S... Artificial Intelligence...
Konferenz
Zu den Favoriten
157

Counting and generating lambda terms
Grygiel, Katarzyna ; Lescanne, Pierre ; Theoretical Computer Science Department [Krakow] (TCS) ; et al.

Lambda calculus combinatorics functional programming test random generator ranking …
E-Ressource
Zu den Favoriten
158

Triangulating Smooth Submanifolds with Light Scaffolding
Boissonnat, Jean-Daniel ; Ghosh, Arijit ; Geometric computing (GEOMETRICA) ; et al.
[Research Report] RR-7660, INRIA. 2011

computational topology computational geometry manifold sampling Manifold triangulation meshing manifold learning …
Report
Zu den Favoriten
159

Dynamic Fractional Resource Scheduling vs. Batch Scheduling
Casanova, Henri ; Stillwell, Mark ; Vivien, Frédéric ; et al.
[Research Report] RR-7659, INRIA. 2011

cluster scheduler virtual machine vector bin packing high performance computi... batch scheduling …
Report
Zu den Favoriten
160

Delaunay Triangulations of Point Sets in Closed Euclidean d-Manifolds
Caroli, Manuel ; Teillaud, Monique ; Geometric computing (GEOMETRICA) ; et al.
[Research Report] RR-7352, INRIA. 2010

Delaunay triangulation Euclidean manifold crystallographic groups simplicial complex flat manifold closed manifold …
Report
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter