Publications related to An Improved Upper Bound for the ErdAs-Szekeres Conjecture

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.

Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation

Volkan Cevher, Andreas Krause, Jonathan Mark Scarlett, Ilija Bogunovic

We present a new algorithm, truncated variance reduction (TruVaR), that treats Bayesian optimization (BO) and level-set estimation (LSE) with Gaussian processes in a unified fashion. The algorithm greedily shrinks a sum of truncated variances within a set ...

2016

Studying Linguistic Changes on 200 Years of Newspapers

Frédéric Kaplan, Vincent Christian Buntinx, Cyril Antoine Michel Bornet

Large databases of scanned newspapers open new avenues for studying linguistic evolution. By studying a two-billion-word corpus corresponding to 200 years of newspapers, we compare several methods in order to assess how fast language is changing. After cri ...

2016

A framework for characterizing RAP clustering in asphalt concrete mixtures

André-Gilles Dumont, Michel Pittet, Sara Bressi, Manfred Partl

Recycled Asphalt Pavement (RAP) is commonly used in asphalt for road rehabilitation or new constructions. Nevertheless, some physical and chemical phenomena that occur during production, laying and compaction of mixtures containing RAP are not yet complete ...

Elsevier Sci Ltd2016

Remarks on Schur's conjecture

János Pach, Filip Moric

Let P be a set of n > d points in for d >= 2. It was conjectured by Zvi Schur that the maximum number of (d-1)-dimensional regular simplices of edge length diam(P), whose every vertex belongs to P, is n. We prove this statement under the condition that any ...

Elsevier Science Bv2015

Progressive Geometric Algorithms

Timur Bagautdinov

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, an ...

Carleton Univ, Dept Mathematics & Statistics2015

On Mining Citations to Primary and Secondary Sources in Historiography

Frédéric Kaplan, Giovanni Colavizza

We present preliminary results from the Linked Books project, which aims at analysing citations from the histo- riography on Venice. A preliminary goal is to extract and parse citations from any location in the text, especially footnotes, both to primary a ...

2015

Double-Normal Pairs In Space

János Pach

A double-normal pair of a finite set S of points that spans R-d is a pair of points {p, q} from S such that S lies in the closed strip bounded by the hyperplanes through p and q perpendicular to pq. A double-normal pair {p, q} is strict if S \ {p,q} lies i ...

London Mathematical Society, Cambridge2015

A note on coloring line arrangements

János Pach, Rom Pinchasi

We show that the lines of every arrangement of n lines in the plane can be colored with O(root n/log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a circle minus(root/log n) factor. Any further imp ...

Electronic Journal Of Combinatorics2014

An Improved Upper Bound for the ErdAs-Szekeres Conjecture

Graph Chatbot

Chat with Graph Search

Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation

Studying Linguistic Changes on 200 Years of Newspapers

A framework for characterizing RAP clustering in asphalt concrete mixtures

Remarks on Schur's conjecture

Progressive Geometric Algorithms

On Mining Citations to Primary and Secondary Sources in Historiography

Double-Normal Pairs In Space

Image coding with incomplete transforms competition for HEVC

A note on coloring line arrangements

Stability of the Classifications of Returns to Scale in Data Envelopment Analysis: A Case Study of the Set of Public Postal Operators

A note on coloring line arrangements

Progressive Geometric Algorithms

Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation

Studying Linguistic Changes on 200 Years of Newspapers

A framework for characterizing RAP clustering in asphalt concrete mixtures

Remarks on Schur's conjecture

On Mining Citations to Primary and Secondary Sources in Historiography

Double-Normal Pairs In Space

Stability of the Classifications of Returns to Scale in Data Envelopment Analysis: A Case Study of the Set of Public Postal Operators

Image coding with incomplete transforms competition for HEVC