• Search: "F.2.2.1: Computations on discrete structures"

Showing 1 - 20 of 29

1

Synchronous Gathering without Multiplicity Detection: a Certified Algorithm
Balabonski, Thibaut ; Delga, Amélie ; Rieg, Lionel ; et al.
Theory of Computing Systems. 63(2):200-218

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.4: Distributed Syste... C.2.4.1: Distributed app... ACM: D.: Software D.4: OPERATING SYSTEMS …
Journal
Save to List
2

Impact Of The Energy Model On The Complexity Of RNA Folding With Pseudoknots
Sheikh, Saad ; Backofen, Rolf ; Ponty, Yann ; et al.
CPM - 23rd Annual Symposium on Combinatorial Pattern Matching - 2012. :321-333

Helsinki, Finland RNA folding General pseudoknots Hardness Inapproximability ACM: J.: Computer Applic... …
Conference
Save to List
3

Generating Shorter Bases for Hard Random Lattices
Alwen, Joël ; Peikert, Chris ; New York University ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :75-86

Freiburg, Germany lattices random short basis average-case hardness Hermite normal form …
Conference
Save to List
4

Generalized Attachment Models for the Genesis of Graphs with High Clustering Coefficient
Gustedt, Jens ; Algorithms for the Grid (ALGORILLE) ; INRIA Lorraine ; et al.
Santo Fortunato and Giuseppe Mangioni and Ronaldo Menezes and Vincenzo Nicosia. Complex Networks - Results of the 2009 International Workshop on Complex Networks (CompleNet 2009). :99-113

attachment models random graph generation k-trees ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Book
Save to List
5

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... …
Conference
Save to List
6

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 …
Conference
Save to List
7

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... …
Journal
Save to List
8

Automating the Addition of Fault Tolerance with Discrete Controller Synthesis
Girault, Alain ; Rutten, Eric ; Programming languages, Operating Systems, Parallelism, and Aspects for Real-Time (POP ART) ; et al.
Formal Methods in System Design. 35:190-225

ACM: C.: Computer System... C.3: SPECIAL-PURPOSE AND... C.3.2: Real-time and emb... ACM: D.: Software D.3: PROGRAMMING LANGUAG... D.3.2: Language Classifi... …
Journal
Save to List
9

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
10

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
11

Une stratégie de recherche basée sur la substituabilité
Rezgui, Mohammed ; Régin, Jean-Charles ; Malapert, Arnaud ; et al.
JFPC 2012 - Huitièmes Journées Francophones de Programmation par Contraintes - 2012, May 2012, Toulouse, France

Toulouse, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.1: Computations on... [INFO.INFO-AI]Computer S... …
Conference
Save to List
12

Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models
Gardy, Danièle ; Ponty, Yann ; Parallélisme, Réseaux, Systèmes, Modélisation (PRISM) ; et al.
GASCOM - 8th conference on random generation of combinatorial structures - 2010, LACIM, UQAM, Sep 2010, Montréal, Canada. 14pp

Montréal, Canada Coupon collector Birthday paradox Random generation Context-free languages ACM: G.: Mathematics of... …
Conference
Save to List
13

Note: Regular languages with no conflicts (forbidden pairs) are regular but have exponential size DFA
Cornet, Alexis ; Laforest, Christian ; Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS) ; et al.
[Research Report] LIMOS (UMR CNRS 6158), université Clermont Auvergne, France 2016

Regular languages DFA forbidden pairs conflicts ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Save to List
14

Building Efficient and Compact Data Structures for Simplicial Complexe
Boissonnat, Jean-Daniel ; Srikanta, Karthik C. ; Tavenas, Sébastien ; et al.
Algorithmica, 2016, ⟨10.1007/s00453-016-0207-y⟩

NP-hard Automaton Compact data structures Simplicial complex ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Journal
Save to List
15

Optimal Mobile Byzantine Fault Tolerant Distributed Storage
Bonomi, Silvia ; del Pozzo, Antonella ; Potop-Butucaru, Maria ; et al.
[Research Report] UPMC - Université Paris 6 Pierre et Marie Curie. 2016

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.0: Complexity of p... F.2.2.1: Computations on... ACM: D.: Software …
Report
Save to List
16

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
Save to List
17

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... …
Conference
Save to List
18

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... …
Conference
Save to List
19

Topological Inference via Meshing
Hudson, Benoît ; Miller, Gary, L. ; Oudot, Steve, Y. ; et al.
[Research Report] RR-7125, INRIA. 2009

Topological persistence Delaunay triangulation offsets sparse Voronoi refinemen... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Save to List
20

Modeling, Analysis, Digital image representation Combinatorial approach of imagery
Modélisation, Analyse, Représentation des Images Numériques Approche combinatoire de l’imagerie
Fiorio, Christophe ; Image & Interaction (ICAR) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
Traitement des images [eess.IV]. Université Montpellier 2, 2008

combinatorial algorithms Digital image image processing digital topology region segmentation Combinatorial maps …
Report
Save to List
Search Tools: Get RSS Feed Email this Search Save Search

Filter