Concept

Course-of-values recursion

Related publications (10)

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Mikhail Kapralov, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakab Tardos

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

ASSOC COMPUTING MACHINERY2020

Displacement Convexity in Spatially Coupled Scalar Recursions

Rüdiger Urbanke, Nicolas Macris, Rafah El-Khatib

We introduce a technique for the analysis of general spatially coupled systems that are governed by scalar recursions. Such systems can be expressed in variational form in terms of a potential function. We show, under mild conditions, that the potential fu ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

The Essence of Dependent Object Types

Martin Odersky, Tiark Rompf, Nada Amin, Sandro Stucki, Karl Samuel Grütter

Focusing on path-dependent types, the paper develops foundations for Scala from first principles. Starting from a simple calculus D-

Springer International Publishing2016

turboTDDFT 2.0 Hybrid functionals and new algorithms within time-dependent density-functional perturbation theory

We present a new release of the turboTDDFT code featuring an implementation of hybrid functionals, a recently introduced pseudo-Hermitian variant of the Liouville-Lanczos approach to time-dependent density-functional perturbation theory, and a newly develo ...

Elsevier Science Bv2014

Explicit Recursive and Adaptive Filtering in Reproducing Kernel Hilbert Spaces

Devis Tuia

This brief presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces. Unlike previous approaches that exploit the kernel trick on filtered and then mapped samples, we explicitly define the model recursivity in the Hilbert spa ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Satisfiability Modulo Recursive Programs

Viktor Kuncak, Philippe Paul Henri Suter, Ali Sinan Köksal

We present a semi-decision procedure for checking satisfiability of expressive correctness properties of recursive first-order functional programs. In our approach, both properties and programs are expressed in the same language, a subset of Scala. We impl ...

Springer-Verlag Berlin2011

Bayesian variable order Markov models

Christos Dimitrakakis

We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism used is close to that employed in context tree weighting. The main contribution is the addition of a prior, conditioned on conte ...

JMLR2010

On Satisfiability Modulo Computable Functions

Viktor Kuncak, Philippe Paul Henri Suter, Ali Sinan Köksal

We present a semi-decision procedure for checking satisfiability of formulas in the language of algebraic data types and integer linear arithmetic extended with user-defined terminating recursive functions. Our procedure is designed to integrate into a DPL ...

2010

Transient analysis of adaptive filters with error nonlinearities

Ali H. Sayed

The paper develops a unified approach to the transient analysis of adaptive filters with error nonlinearities. In addition to deriving earlier results in a unified manner, the approach also leads to new performance results without restricting the regressio ...

IEEE2003

Transient analysis of data-normalized adaptive filters

Ali H. Sayed

Abstract: This paper develops an approach to the transient analysis of adaptive filters with data normalization. Among other results, the derivation characterizes the transient behavior of such filters in terms of a linear time-invariant state-space model ...

IEEE2003

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.