Publications related to Efficient Learning from Comparisons

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Choice set generation for iterated DTA simulations

Michel Bierlaire, Gunnar Flötteröd

We apply the Metropolis-Hastings algorithm to efficiently sample from arbitrary paths distributions in a general network. Paths can be generalized into all-day travel plans through, e.g., an appropriate network expansion. The Metropolis-Hastings algorithm ...

2011

Overcoming the limitations of traditional model-updating approaches

Ian Smith, James-Alexandre Goulet

Model updating is useful for improving structural performance assessments. This paper examines an important assumption of traditional model-updating approaches. This assumption requires the error independence between points where predictions and measuremen ...

ASCE2011

Neighbor discovery with reception status feedback to transmitters

Ramin Khalili

Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

2010

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer2010

Evaluation of Control and Modulation Methods for Modular Multilevel Converters

Michail Vasiladiotis, Daniel Siemaszko

The modular multilevel converter is a promising converter technology for various high-voltage high-power applications. Despite the apparent simplicity of the circuit, the inherent dynamics of the converter and the balancing of the sub-module capacitor volt ...

2010

A generic calibration framework for joint estimation of car following models using microscopic data

Microscopic simulation models have become widely applied tools in traffic engineering. Nevertheless, parameter identification of these models remains a difficult task. This is for one caused by the fact that parameters are generally not directly observable ...

2010

The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths

Krister Swenson

Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a negative result on the rate of convergence of the generally used Markov chains. ...

2010

Likelihood-Based Inference for Max-Stable Processes

Simone Padoan

The last decade has seen max-stable processes emerge as a common tool for the statistical modeling of spatial extremes However, their application is complicated due to the unavailability of the multivariate density function and so likehhood-based methods r ...

American Statistical Association2010

Efficient Learning from Comparisons

Graph Chatbot

Chat with Graph Search

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Choice set generation for iterated DTA simulations

Overcoming the limitations of traditional model-updating approaches

Neighbor discovery with reception status feedback to transmitters

Sorting signed permutations by inversions in O(nlogn) time

Ordered Sets in the Calculus of Data Structures

Evaluation of Control and Modulation Methods for Modular Multilevel Converters

A generic calibration framework for joint estimation of car following models using microscopic data

The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths

Likelihood-Based Inference for Max-Stable Processes

Neighbor discovery with reception status feedback to transmitters

Overcoming the limitations of traditional model-updating approaches

Ordered Sets in the Calculus of Data Structures

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Choice set generation for iterated DTA simulations

A generic calibration framework for joint estimation of car following models using microscopic data

The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths

Likelihood-Based Inference for Max-Stable Processes

Sorting signed permutations by inversions in O(nlogn) time

Evaluation of Control and Modulation Methods for Modular Multilevel Converters