Realizability of planar point embeddings from angle measurements
Related publications (34)
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.
I4U is a joint entry of nine research Institutes and Universities across 4 continents to NIST SRE 2012. It started with a brief discussion during the Odyssey 2012 workshop in Singapore. An online discussion group was soon set up, providing a discussion pla ...
A significant theme in data envelopment analysis (DEA) is the stability of returns to scale (RTS) classification of specific decision making unit (DMU) which is under observed production possibility set. In this study the observed DMUs are public postal op ...
The submission of I4U, is a joint effort of nine research Institutes and Universities across 4 continents for submitting speaker recognition results to NIST SRE 2012. The joint efforts were started with a brief discussion during the Odyssey 2012 workshop i ...
In this paper, we extend the theory of sampling signals with finite rate of innovation (FRI) to a specific class of two-dimensional curves, which are defined implicitly as the zeros of a mask function. Here the mask function has a parametric representation ...
Institute of Electrical and Electronics Engineers2014
This paper aims to maximize the profitability of a set of brand SKUs stocked at a particular retailer by optimizing the number of facings for each product. Based on the past data, a set of variables such as retail price of different SKUs, linear footage th ...
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functional lists. We first show how to decide in NP the satisfiability problem for lo ...
The Vehicle Routing Problem with Time Windows consists of computing a minimum cost set of routes for a fleet of vehicles of limited capacity visiting a given set of customers with known demand, with the additional constraint that each customer must be visi ...
Let n >= 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n straight-line edges such that the angle between any two consecutive edges is at m ...
In real-time optimization, enforcing the constraints that need to be active is important for optimality. In fact, it has been established in the context of parametric variations that, if these constraints are not satisfied, the optimality loss would be O($ ...