Publications associées à Algorithme de recherche de sous-chaîne

List Ordered Statistics Decoders for Polar Codes

Andreas Peter Burg, Yifei Shen, Chuan Zhang

The de-facto standard decoding algorithm for polar codes, successive cancellation list (SCL) decoding, is a breadth-first search algorithm. By keeping a list of candidate codewords, SCL decoding improves the performance as the list size L increases. Howeve ...

IEEE2022

An Analysis of Super-Net Heuristics in Weight-Sharing NAS

Mathieu Salzmann, Kaicheng Yu

Weight sharing promises to make neural architecture search (NAS) tractable even on commodity hardware. Existing methods in this space rely on a diverse set of heuristics to design and train the shared-weight backbone network, a.k.a. the super-net. Since he ...

IEEE COMPUTER SOC2022

Asymptotic decoupling and weak Gibbs measures for finite alphabet shift spaces

Charles Pfister

For the spaceXin a large class of finite alphabet shift spaces (lattice models) and the class of functionsfwith bounded total oscillations, we prove that each equilibrium measure nu atf=phi is a weak Gibbs measures for phi-P(phi). In addition, the empirica ...

2020

Fractal-like Mechanical Resonators with a Soft-Clamped Fundamental Mode

Tobias Kippenberg, Sergey Fedorov, Alberto Beccari, Nils Johan Engelsen

Self-similar structures occur naturally and have been employed to engineer exotic physical properties. We show that acoustic modes of a fractal-like system of tensioned strings can display increased mechanical quality factors due to the enhancement of diss ...

AMER PHYSICAL SOC2020

An Optimal Planning Framework to Deploy Self-Reconfigurable Modular Robots

Auke Ijspeert, Mehmet Hasan Mutlu, Simon Lukas Hauser, Hala Khodr, Alexandre Bernardino

Self-reconfiguration is a hard problem due to the high dimensionality of self-reconfigurable modular systems. Searchbased approaches offer complete and optimal solutions. However, naive search algorithms cannot directly solve self-reconfiguration tasks in ...

2019

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

Real-Time Neural Signals Decoding onto Off-the-Shelf DSP Processors for Neuroprosthetic Applications

Silvestro Micera, Stanisa Raspopovic

The control of upper limb neuroprostheses through the peripheral nervous system (PNS) can allow restoring motor functions in amputees. At present, the important aspect of the realtime implementation of neural decoding algorithms on embedded systems has bee ...

Ieee-Inst Electrical Electronics Engineers Inc2016

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Mechanism of the Cassie-Wenzel transition via the atomistic and continuum string methods

Simone Meloni

The string method is a general and flexible strategy to compute the most probable transition path for an activated process (rare event). We apply here the atomistic string method in the density field to the Cassie-Wenzel transition, a central problem in th ...

Amer Inst Physics2015

A Scalable Approach to Harvest Modern Weblogs

Olivier Eric Paul Blanvillain

Blogs are one of the most prominent means of communication on the web. Their content, interconnections and influence constitute a unique socio-technical artefact of our times which needs to be preserved. The BlogForever project has established best practic ...

World Scientific Publ Co Pte Ltd2015

What is the color of chocolate? - extracting color values of semantic expressions

Sabine Süsstrunk, Albrecht Johannes Lindner

We present a statistical framework to automatically determine an associated color for a given arbitrary semantic expression. The expression can not only be a color name but any word or character string. In addition to the color value, we are also able to c ...

2012

Embedding cylinder quality measures into Minutia Cylinder-Code based latent fingerprint matching

Andrzej Drygajlo, Mohammad Hamed Izadi

One of the major problems concerning latent fingerprint matching in forensic applications is the poor quality of fingerprint data. Therefore, local quality assessment of fingerprint images is necessary to ensure high biometric performance in this applicati ...

ACM Press2012

Nonlocal Means With Dimensionality Reduction and SURE-Based Parameter Selection

Dimitri Nestor Alice Van De Ville, Michel Kocher

Nonlocal means (NLM) is an effective denoising method that applies adaptive averaging based on similarity between neighborhoods in the image. An attractive way to both improve and speed-up NLM is by first performing a linear projection of the neighborhood. ...

IEEE2011

Identifying clusters as low-lying minima - Efficiency of stochastic and genetic algorithms using inexpensive electronic structure levels

Anne-Clémence Corminboeuf, Fabrice Avaltroni

Molecular candidates possessing unconventional chemical bonding paradigms (e.g., boron wheels, molecular stars, and multicenter bonding) have attracted a great deal of attention by the computational community. The viability of such systems is necessarily a ...

Wiley-Blackwell2011

Evaluating Top-k Queries over Incomplete Data Streams

Karl Aberer, Parisa Haghani, Sebastian Michel

We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addressed research topic in recent years. However, most approaches assume the strea ...

2009

Fast spin +-2 spherical harmonics transforms and application in cosmology

Pierre Vandergheynst, Yves Wiaux, Laurent Jacques

A fast and exact algorithm is developed for the spin +-2 spherical harmonics transforms on equi-angular pixelizations on the sphere. It is based on the Driscoll and Healy fast scalar spherical harmonics transform. The theoretical exactness of the transform ...

2007