Publications related to Linear search

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

Adiabatic quantum-flux parametron (AQFP) is an energy-efficient superconducting technology. Buffer and splitter (B/S) cells must be inserted to an AQFP circuit to meet the technology-imposed constraints on path balancing and fanout branching. These cells a ...

ACM2022

Sublinear Algorithms for Spectral Graph Clustering

Aidasadat Mousavifar

This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...

EPFL2021

Scalable and Efficient Comparison-based Search without Features

Matthias Grossglauser, Lucas Maystre, Daniyar Chumbalov

We consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i, j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generate ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2020

Inner-Loop-Free ADMM for Cryo-EM

Michaël Unser, Laurène Donati, Emmanuel Emilien Louis Soubies

Thanks to recent advances in signal processing, the interest for fast ℓ1-regularized reconstruction algorithms in cryo-electron microscopy (cryo-EM) has intensified. The approaches based on the alternating-direction of multipliers method (ADMM) are particu ...

IEEE2019

Search for the lepton-flavor-violating decay B-0 -> K-*0 mu(+/-)e(-/+)

Olivier Schneider, Roberto Gargiani, Yiming Li, Mingkui Wang, Gaétan Charles Antoine Giriat, Sun Hee Kim, Chao Wang, Tagir Aushev, Tara Nanut, Chang-Hyun Park, Seyed Sina Mirrazavi Salehian, Hiroyasu Yamamoto, Jun Yong Kim, Arnaud Michel Gelb, Ji Hyun Kim, Taoufiq Harach, Donghyun Kim, Yong Chan Choi, Linlin Cao, Martin Lubej, Xiao Wang, Jiayun Shen, Lei Li

We have searched for the lepton-flavor-violating decay B-0 -> K-*0 mu(+/-)e(-/+) using a data sample of 711 fb(-1) that contains 772 x 10(6) B (B) over bar pairs. The data were collected near the Upsilon(4S) resonance with the Belle detector at the KEKB as ...

American Physical Society2018

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017

A New Framework for Distributed Submodular Maximization

Justin Dean Ward

A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing distributed algo ...

Ieee2016

A New FFT-Based Algorithm for Secondary Code Acquisition for Galileo Signals

Pierre-André Farine, Cyril Botteron, Aleksandar Jovanovic, Jérôme Leclère, Youssef Tawk

The innovative spreading codes used to modulate the new Galileo signals creates new challenges for receiver designers. It is well known in GNSS systems that longer integration times are needed to obtain a better sensitivity. However, the existence of the n ...

IEEE2011

Tools and Frameworks for Big Learning in Scala: Leveraging the Language for High Productivity and Performance

Martin Odersky, Heather Christine Klug, Philipp Haller

Implementing machine learning algorithms for large data, such as the Web graph and social networks, is challenging. Even though much research has focused on making sequential algorithms more scalable, their running times continue to be prohibitively long. ...

2011

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

Early consensus in complex networks under variable graph topology

Martin Hasler, Leonidas Georgopoulos

Analysis of the linear algorithm for consensus on complex networks shows the existence of two distinct phases, the asymptotic and the transient. The network reaches the asymptotic when the components corresponding to the spectral gap eigenvalue of the weig ...

IEEE2009

Accelerating Distributed Consensus Using Extrapolation

Pascal Frossard, Effrosyni Kokiopoulou

In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature attack this problem by distributed linear iterative algorithms, wi ...

IEEE Institute of Electrical and Electronics Engineers2007

Search for lepton flavor violating decays τ- → ℓ- π0, ℓ- η, ℓ- η′

Olivier Schneider, Chao Wang, Lei Zhang, Sun Hee Kim, Sanjeev Kumar, Jing Li

We have searched for lepton flavor violating semileptonic τ- decays using a data sample of 153.8 fb-1 accumulated with the Belle detector at the KEKB e+e- collider. For the six decay modes studied, the observed yield is compatible with the estimated backgr ...

2005

Performance enhancement of active structures during service lives

Bernd Domer

This thesis describes a successful application of advanced computational methods to tasks in the field of active structural control. The control-task involves finding good control movements for a highly coupled, non-linear structure. It is demonstrated how ...

EPFL2003