Concept

Divide-and-conquer algorithm

Related publications (346)

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.

PyBrain

Yi Sun, Daniël Pieter Wierstra, Tom Schaul

PyBrain is a versatile machine learning library for Python. Its goal is to provide flexible, easy-to-use yet still powerful algorithms for machine learning tasks, including a variety of predefined environments and benchmarks to test and compare algorithms. ...

Massachusetts Institute of Technology Press2010

Stable routing under the Spanning Tree Protocol

Laura Sanità

The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we design efficient algorithms to compute polynomial-size integer weights so as t ...

Elsevier2010

On the computation of structured singular values and pseudospectra

Daniel Kressner, Effrosyni Kokiopoulou

Structured singular values and pseudospectra play an important role in assessing the properties of a linear system under structured perturbations. This paper discusses computational aspects of structured pseudospectra for structures that admit an eigenvalu ...

2010

Additive Combinatorics and Discrete Logarithm Based Range Protocols

Rafik Chaabouni, Helger Lipmaa

We show how to express an arbitrary integer interval

I = [0, H]

as a sumset

I = \sum_{i=1}^\ell G_i * [0, u - 1] + [0, H']

of smaller integer intervals for some small values

\ell

u

, and

H' < u - 1

, where

b * A = \{b a : a \in A\}

and $A + B = ...

Springer2010

Moving horizon partition-based state estimation of large-scale systems

Giancarlo Ferrari Trecate, Marcello Farina

This paper presents three novel Moving Horizon Estimation (MHE) methods for discrete-time partitioned linear systems, i.e. systems decomposed into coupled subsystems with non-overlapping states. The MHE approach is used due to its capability of exploiting ...

2010

Tiling Freeform Shapes with Straight Panels: Algorithmic Methods

Bailin Deng

This paper shows design studies with bent panels which are originally rectangular or at least approximately rectangular. Based on recent results obtained in the geometry processing community, we algorithmically approach the questions of an exact rectangula ...

2010

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Robert Granger

We show that for any elliptic curve

E(\mathbb{F}_{q^n})

, if an adversary has access to a Static Diffie-Hellman Problem (Static DHP) oracle, then by making

O(q^{1-\frac{1}{n+1}})

Static DHP oracle queries during an initial learning phase, for fixed $n>1 ...

Springer Berlin Heidelberg2010

State estimation for large-scale partitioned systems: a moving horizon approach

Giancarlo Ferrari Trecate, Marcello Farina

2010

Learning from Candidate Labeling Sets

Jie Luo

In many real world applications we do not have access to fully-labeled training data, but only to a list of possible labels. This is the case, e.g., when learning visual classifiers from images downloaded from the web, using just their text captions or tag ...

MIT Press2010

A Divide-and-Conquer Approach for Solving Interval Algebra Networks

Jingshi Li

Deciding consistency of constraint networks is a fundamental problem in qualitative spatial and temporal reasoning. In this paper we introduce a divide-and-conquer method that recursively partitions a given problem into smaller sub-problems in deciding con ...

2009