Search results for " algorithm"

showing 10 items of 2538 documents

Packing of two copies of a caterpillar into its third power

2003

International audience

[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

Deux algorithmes d'intersection des surfaces de subdivision

2002

National audience

[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

Squelettisation des objets 3D par des projections

2003

National audience

[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

Feedback vertex set for distance and circulant graphs

2002

National audience

[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

Force d'irrégularité des graphes circulants

2003

National audience

[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

Grundy numbers of powers of graphs

2006

International audience

[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

Trois algorithmes d'intersection des surfaces de subdivision

2003

International audience

[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

Skeletizing 3D-objetcs by projections

2004

International audience

[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]ComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

Terpyridine-based metallopolymer thin films as active layer in ammonia sensor device

2016

International audience; A metal-containing polymer has been prepared by electropolymerization of an homoleptic Ru(II)-terpyridine complex bearing pyrrole heterocycles. The polymer is obtained as a thinfilm at the surface ofelectrodes, and has been characterized by electrochemical measurements, XPS and microscopy. It hasbeen shown that this polymer acts as an active gas sensitive layer since it enables the detection of anammonia gasflow through layer’s resistivity measurements.

[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Nanotechnology02 engineering and technology010402 general chemistry01 natural sciences[SPI.AUTO]Engineering Sciences [physics]/Automatic[SPI.MAT]Engineering Sciences [physics]/Materialschemistry.chemical_compoundX-ray photoelectron spectroscopyMaterials ChemistryThin filmHomoleptic[SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronicschemistry.chemical_classification[SPI.ACOU]Engineering Sciences [physics]/Acoustics [physics.class-ph]ChemistryMechanical EngineeringMetals and AlloysPolymer021001 nanoscience & nanotechnologyCondensed Matter Physics0104 chemical sciencesElectronic Optical and Magnetic MaterialsActive layerChemical engineeringMechanics of MaterialsElectrodeTerpyridine0210 nano-technology[PHYS.ASTR]Physics [physics]/Astrophysics [astro-ph]Layer (electronics)
researchProduct

Presentations of constrained systems with unconstrained positions

2005

International audience; We give a polynomial-time construction of the set of sequences that satisfy a finite-memory constraint defined by a finite list of forbidden blocks, with a specified set of bit positions unconstrained. Such a construction can be used to build modulation/error-correction codes (ECC codes) like the ones defined by the Immink-Wijngaarden scheme in which certain bit positions are reserved for ECC parity. We give a lineartime construction of a finite-state presentation of a constrained system defined by a periodic list of forbidden blocks. These systems, called periodic-finite-type systems, were introduced by Moision and Siegel. Finally, we present a linear-time algorithm for con…

[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]finite-memory systemperiodic-finite-type (PFT) system[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technologyLibrary and Information Sciences01 natural sciencesModulation coding0202 electrical engineering electronic engineering information engineeringMathematicsDiscrete mathematicsChannel codefinite-state encodermodulation codeDAWG020206 networking & telecommunicationsDirected graphDirected acyclic graphforbidden blockComputer Science ApplicationsFinite sequence010201 computation theory & mathematicscodeError detection and correctionrun-length limited (RLL) codesInformation SystemsCoding (social sciences)maximum transition run (MTR)
researchProduct