Publications related to Scalable and Efficient Comparison-based Search without Features

A Low-Power Correlator for Wakeup Receivers with Algorithm Pruning through Early Termination

Andreas Peter Burg, Adam Shmuel Teman, Reza Ghanaatian Jahromi, Jeremy Hugues-Felix Constantin

A low-complexity, low-power digital correlator for wakeup receivers is presented. With the proposed algorithm, unnecessary computational cycles are dynamically pruned from the correlation using an early threshold check. For the algorithm, we provide a rigo ...

Ieee2016

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

Unlabeled Sensing

Golnooshsadat Elhami

Like other data sensing problems, in unlabeled sensing, the target is to solve the equation y = Φx by finding vector x given a set of sample values in vector y as well as the matrix Φ. However, the main challenge in unlabeled sensing is that the correct or ...

2015

Compute-and-Forward: Finding the Best Equation

Michael Christoph Gastpar, Saeid Sahraei

Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optim ...

2014

On Self-interference Suppression Methods for Low-complexity Full-duplex MIMO

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Pavle Belanovic, Konstantinos Alexandris

Full-duplex wireless communication offers improved spectral efﬁciency, as well as more efﬁcient relaying and medium access, but requires suppression of self-interference. In this paper we analyze the existing methods for active RF suppression and use the ” ...

2013

A Speculation-Friendly Binary Search Tree

Vincent Gramoli

We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-speculative) accesses to have a bounded complexity. Researchers tried to evaluate t ...

Assoc Computing Machinery2012

Black-box optimization benchmarking of IPOP-saACM-ES on the BBOB-2012 noisy testbed

Ilya Loshchilov

In this paper, we study the performance of IPOP-saACM-ES, recently proposed self-adaptive surrogate-assisted Covariance Matrix Adaptation Evolution Strategy. The algorithm was tested using restarts till a total number of function evaluations of 10^6D was r ...

2012

A transformable tensegrity-ring footbridge

Ian Smith, Landolf-Giosef-Anastasios Rhode-Barbarigos, René Motro

Tensegrity structures are spatial reticulated structures composed of cables and struts. A tension-compression equilibrium leads to lightweight systems that change shape through length changes in their members. Active members thus control several degrees of ...

2012

Routing and search on large scale networks

Dominique Florian Tschopp

In this thesis, we address two seemingly unrelated problems, namely routing in large wireless ad hoc networks and comparison based search in image databases. However, the underlying problem is in essence similar and we can use the same strategy to attack t ...

EPFL2010

Constructing and decoding GWBE codes using Kronecker products

Mohammadjavad Faraji, Pedram Pad

In this letter, we introduce a novel method for constructing large size generalized Welch bound equality (GWBE) matrices. This method can also be used for the construction of large WBE matrices. The advantage of this method is its low complexity for constr ...

Institute of Electrical and Electronics Engineers2010

Scalable and Efficient Comparison-based Search without Features

Graph Chatbot

Chat with Graph Search

A Low-Power Correlator for Wakeup Receivers with Algorithm Pruning through Early Termination

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

Unlabeled Sensing

Compute-and-Forward: Finding the Best Equation

On Self-interference Suppression Methods for Low-complexity Full-duplex MIMO

A Speculation-Friendly Binary Search Tree

Black-box optimization benchmarking of IPOP-saACM-ES on the BBOB-2012 noisy testbed

A transformable tensegrity-ring footbridge

Routing and search on large scale networks

Constructing and decoding GWBE codes using Kronecker products

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

A Low-Power Correlator for Wakeup Receivers with Algorithm Pruning through Early Termination

On Self-interference Suppression Methods for Low-complexity Full-duplex MIMO

Black-box optimization benchmarking of IPOP-saACM-ES on the BBOB-2012 noisy testbed

Constructing and decoding GWBE codes using Kronecker products

Unlabeled Sensing

A transformable tensegrity-ring footbridge

A Speculation-Friendly Binary Search Tree

Routing and search on large scale networks

Compute-and-Forward: Finding the Best Equation