Search results for "algorithm."

showing 10 items of 4617 documents

Computing the Original eBWT Faster, Simpler, and with Less Memory

2021

Mantaci et al. [TCS 2007] defined the \(\mathrm {eBWT}\) to extend the definition of the \(\mathrm {BWT}\) to a collection of strings. However, since this introduction, it has been used more generally to describe any \(\mathrm {BWT}\) of a collection of strings, and the fundamental property of the original definition (i.e., the independence from the input order) is frequently disregarded. In this paper, we propose a simple linear-time algorithm for the construction of the original \(\mathrm {eBWT}\), which does not require the preprocessing of Bannai et al. [CPM 2021]. As a byproduct, we obtain the first linear-time algorithm for computing the \(\mathrm {BWT}\) of a single string that uses …

2019-20 coronavirus outbreakSpeedupString collectionsBig BWTSettore INF/01 - InformaticaSevere acute respiratory syndrome coronavirus 2 (SARS-CoV-2)String (computer science)Suffix arrayOrder (ring theory)omega-orderQuantitative Biology::GenomicsBurrows-Wheeler-TransformBurrows-Wheeler-Transform String collections SAIS Big BWT prefix-free parsing extended BWTlaw.inventionCombinatoricsprefix-free parsingSimple (abstract algebra)lawSAISSAIS algorithmIndependence (probability theory)extended BWTMathematics
researchProduct

A coarse to fine 3D acquisition system

2015

International audience; The 3D chain (acquisition-processing-compression) is , most of the time , sequenced into several steps. Such approaches result into an one-dense acquisition of 3D points. In large scope of applications , the first processing step consists in simplifying the data. In this paper , we propose a coarse to fine acquisition system which permits to obtain simplified data directly from the acquisition. By calculating some complementary information from 2D images , such as 3D normals , multiple homogeneous regions will be segmented and affected to a given primitive class. Contrary to other studies , the whole process is not based on a mesh. The obtained model is simplified di…

2d images0209 industrial biotechnologyScannerbusiness.industryComputer scienceProcess (computing)3D Compression[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020207 software engineeringClass (philosophy)02 engineering and technology3D Simplification[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Coarse to finePrimitives extraction[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020901 industrial engineering & automationHomogeneous0202 electrical engineering electronic engineering information engineeringComputer visionArtificial intelligencebusiness3D ReconstructionAlgorithmScope (computer science)
researchProduct

Enhanced field-of-view integral imaging display using multi-Köhler illumination.

2014

A common drawback in 3D integral imaging displays is the appearance of pseudoimages beyond the viewing angle. These pseudoimages appear when the light rays coming from each elemental image are not passing through the corresponding microlens, and a set of barriers must be used to avoid this flipping effect. We present a pure optical arrangement based on Köhler illumination to generate these barriers thus avoiding the pseudoimages. The proposed system does not use additional lenses to project the elemental images, so no optical aberrations are introduced. As an added benefit, Köhler illumination provides a higher contrast 3D display. This work was supported in part by the Plan Nacional I + D …

3-D displayslight raysField of viewStereo displaySensitivity and SpecificityOpticsImaging Three-DimensionalImage Interpretation Computer-AssistedKöhler illuminationLightingviewing angleoptical arrangementPhysicsMicrolensIntegral imagingbusiness.industryReproducibility of ResultsViewing angleImage EnhancementRayAtomic and Molecular Physics and Opticsintegral imagingLight intensity3D integral imagingfield of viewselemental imagesbusinessArtifactsAlgorithmsOptics express
researchProduct

SAMSLAM: Simulated Annealing Monocular SLAM

2013

This paper proposes a novel monocular SLAM approach. For a triplet of successive keyframes, the approach inteleaves the registration of the three 3D maps associated to each image pair in the triplet and the refinement of the corresponding poses, by progressively limiting the allowable reprojection error according to a simulated annealing scheme. This approach computes only local overlapping maps of almost constant size, thus avoiding problems of 3D map growth. It does not require global optimization, loop closure and back-correction of the poses.

3D RegistrationSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniRANSACSettore INF/01 - InformaticaComputer scienceDisparityComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONReprojection errorLimitingStructure from MotionPose EstimationLoop closureComputer Science::Computer Vision and Pattern RecognitionSLAMSimulated annealingImage pairMonocular slamSimulated AnnealingConstant (mathematics)Global optimizationAlgorithmVisual SLAMFeature Matching
researchProduct

Dataa näkyvissä: Läpinäkyvyys algoritmien ja datan journalistisessa hyödyntämisessä

2021

Läpinäkyvyyden käsite on noussut keskeiseksi viestinnän, median ja politiikan tutkimuksessa sekä viestinnän ja politiikan käytäntöjen eettisessä arvioinnissa. Läpinäkyvyyttä on esitetty keinoksi ylläpitää ja kasvattaa luottamusta journalistista työtä ja sen tuotteita kohtaan interaktiivisessa media- ja viestintäympäristössä. Tiedontuotannon ja päätöksenteon perustuessa yhä enemmän dataan ja sen prosessointiin läpinäkyvyys on noussut keskeiseksi käsitteeksi myös algoritmisen päätöksenteon kohdalla. Tässä artikkelissa tarkastelemme läpinäkyvyyden roolia dataa ja algoritmeja sekä journalismia koskevassa keskustelussa ja esitämme mahdollisuuksia dataan ja algoritmeihin tukeutuvan journalismin l…

518 Media- ja viestintätieteeteducationpäätöksentekoammattietiikkajournalismalgorithmsdecision makingläpinäkyvyysautomaatioalgoritmitTeemanumero: Dataistunut mediaautomationtransparencyH1-99mediaCommunication. Mass mediatrust16. Peace & justiceeettisyysP87-96Journalism. The periodical press etc.PN4699-5650Social sciences (General)datavastuuluottamusjournalismiresponsibilityluotettavuusMedia & Viestintä
researchProduct

"Table 20" of "Search for a Heavy Neutral Particle Decaying to $e\mu$, $e\tau$, or $\mu\tau$ in $pp$ Collisions at $\sqrt{s}=8$ TeV with the ATLAS De…

2015

Inputs used for the $\tilde{\nu}_{\tau}$-->$e\mu$ channel limit setting.

8000.0NComputer Science::Data Structures and AlgorithmsComputer Science::Information Theory
researchProduct

"Table 43" of "Search for massive, long-lived particles using multitrack displaced vertices or displaced lepton pairs in pp collisions at $\sqrt{s}$ …

2015

Vertex mass distributions in data and one RPV SUSY signal model, for vertices with 0, 1 and $\geq$2 charged leptons in the dilepton $\mu^+\mu^-$ channel. The entries are the number of DVs in each bin, not normalized according to bin size. The signal model is for gluino pair production, with $\tilde{g}\to qq[\tilde{\chi}_1^0\to e\mu\nu/\mu\mu\nu]$ decays, $m(\tilde{g})$ = 1300 GeV, $m(\tilde{\chi}_1^0)$ = 50 GeV and $c\tau(\tilde{\chi}_1^0)$ = 30 mm.

8000.0Proton-Proton ScatteringHigh Energy Physics::PhenomenologyP P --> GLUINO GLUINOExclusiveHigh Energy Physics::ExperimentNComputer Science::Data Structures and Algorithms
researchProduct

"Table 41" of "Search for massive, long-lived particles using multitrack displaced vertices or displaced lepton pairs in pp collisions at $\sqrt{s}$ …

2015

Vertex mass distributions in data and one RPV SUSY signal model, for vertices with 0, 1 and $\geq$2 charged leptons in the dilepton $e^+e^-$ channel. The entries are the number of DVs in each bin, not normalized according to bin size. The signal model is for gluino pair production, with $\tilde{g}\to qq[\tilde{\chi}_1^0\to e\mu\nu/ee\nu]$ decays, $m(\tilde{g})$ = 1300 GeV, $m(\tilde{\chi}_1^0)$ = 50 GeV and $c\tau(\tilde{\chi}_1^0)$ = 30 mm.

8000.0Proton-Proton ScatteringHigh Energy Physics::PhenomenologyP P --> GLUINO GLUINOExclusiveHigh Energy Physics::ExperimentNComputer Science::Data Structures and Algorithms
researchProduct

"Table 13" of "Search for massive, long-lived particles using multitrack displaced vertices or displaced lepton pairs in pp collisions at $\sqrt{s}$ …

2015

Upper limits (95% CL) on the number of dilepton ($e^+e^-+e^{\pm}\mu^{\mp}+\mu^+\mu^-$) displaced vertices in 20.3 fb$^{-1}$ and the corresponding vertex-level efficiencies (from Auxiliary Figure 5d) for two GGM SUSY models as a function of the $\tilde{\chi}_1^0$ proper decay distance $c\tau$. The models consider gluino pair production, with $\tilde{g}\to qq[\tilde{\chi}_1^0\to Z\tilde{G}]$ decays, $m(\tilde{g})$ = 1100 GeV and $m(\tilde{\chi}_1^0)$ = 1000 GeV.

8000.0Proton-Proton ScatteringP P --> GLUINO GLUINOEFFExclusiveHigh Energy Physics::ExperimentNComputer Science::Data Structures and Algorithms
researchProduct

"Table 12" of "Search for massive, long-lived particles using multitrack displaced vertices or displaced lepton pairs in pp collisions at $\sqrt{s}$ …

2015

Upper limits (95% CL) on the number of dilepton ($e^+e^-+e^{\pm}\mu^{\mp}+\mu^+\mu^-$) displaced vertices in 20.3 fb$^{-1}$ and the corresponding vertex-level efficiencies (from Auxiliary Figure 5d) for two GGM SUSY models as a function of the $\tilde{\chi}_1^0$ proper decay distance $c\tau$. The models consider gluino pair production, with $\tilde{g}\to qq[\tilde{\chi}_1^0\to Z\tilde{G}]$ decays, $m(\tilde{g})$ = 1100 GeV and $m(\tilde{\chi}_1^0)$ = 400 GeV.

8000.0Proton-Proton ScatteringP P --> GLUINO GLUINOEFFExclusiveHigh Energy Physics::ExperimentNComputer Science::Data Structures and Algorithms
researchProduct