Publications related to Finding all common bases in two matroids

SHAPE: Linear-Time Camera Pose Estimation With Quadratic Error-Decay

Martin Vetterli, Adam James Scholefield, Alireza Ghasemi

We propose a novel camera pose estimation or perspective-n-point (PnP) algorithm, based on the idea of consistency regions and half-space intersections. Our algorithm has linear time-complexity and a squared reconstruction error that decreases at least qua ...

Ieee2016

Artist-Oriented 3D Character Posing from 2D Strokes

Ronan Boulic, Benoît Le Callennec, Mentar Mahmudi, Pawan Kumar Harish

In this paper we present an intuitive tool suitable for 2D artists using touch-enabled pen tablets. An artist-oriented tool should be easy-to-use, real-time, versatile, and locally refinable. Our approach uses an interactive system for 3D character posing ...

Elsevier2016

Observations on the LPN Solving Algorithm from Eurocrypt'16

Serge Vaudenay, Sonia Mihaela Bogos

In this note we re-evaluate the Eurocrypt’16 paper by Zhang et al. [9] in the area of LPN solving algorithms. We present the history of LPN solving algorithms and give the general description of the algorithm from [9]. While this new algorithm claims to im ...

2016

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

Partial Recovery Bounds for the Sparse Stochastic Block Model

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge probabilities

\frac{a}{n}

and

\frac{b}{n}

respectively. We consider the ...

Ieee2016

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

Institute of Electrical and Electronics Engineers2015

A Thrifty Universal Construction

Rachid Guerraoui, Cheng Wang

A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and wait-free manner. Such constructions require underlying low-level universal shar ...

2015

Distributed Policy Evaluation Under Multiple Behavior Strategies

Ali H. Sayed

We apply diffusion strategies to develop a fully-distributed cooperative reinforcement learning algorithm in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment. The algorithm can also be ...

IEEE2015

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

Mario Paolone, Paolo Romano, Marco Pignati

The simulation of Phasor Measurement Units (PMUs) into real-time simulators (RTSs) is typically limited by the complexity of the synchrophasor estimation (SE) algorithm. This is especially true when dealing with distribution network PMUs due to the more de ...

IEEE2015

Capacity and Data Complexity in Multidimensional Linear Attack

Serge Vaudenay, Jialin Huang

Multidimensional linear attacks are one of the most powerful variants of linear cryptanalytic techniques now. However, there is no knowledge on the key-dependent capacity and data complexity so far. Their values were assumed to be close to the average valu ...

Springer2015

Finding all common bases in two matroids

Graph Chatbot

Chat with Graph Search

SHAPE: Linear-Time Camera Pose Estimation With Quadratic Error-Decay

Artist-Oriented 3D Character Posing from 2D Strokes

Observations on the LPN Solving Algorithm from Eurocrypt'16

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

Partial Recovery Bounds for the Sparse Stochastic Block Model

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

A Thrifty Universal Construction

Distributed Policy Evaluation Under Multiple Behavior Strategies

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

Capacity and Data Complexity in Multidimensional Linear Attack

Partial Recovery Bounds for the Sparse Stochastic Block Model

Artist-Oriented 3D Character Posing from 2D Strokes

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

Distributed Policy Evaluation Under Multiple Behavior Strategies

SHAPE: Linear-Time Camera Pose Estimation With Quadratic Error-Decay

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Observations on the LPN Solving Algorithm from Eurocrypt'16

A Thrifty Universal Construction

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

Capacity and Data Complexity in Multidimensional Linear Attack