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

A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows

The Vehicle Routing Problem with Soft Time Windows consists in computing a minimum cost set of routes for a fleet of vehicles of limited capacity that must visit a given set of customers with known demand, with the additional feature that each customer exp ...

2009

A property of Bp(G). Applications to convolution operators

Antoine Derighetti

A new property of B-p(G), permits to obtain an approximation theorem for p-convolution operators and a non-commutative version of the Lohoues monomorphism theorem concerning the norm closure of the set of all p-convolution operators with compact support. ( ...

2009

On the weakest failure detector ever

Rachid Guerraoui

Many problems in distributed computing are impossible to solve when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to circumvent some specific impossibility, e. g., consen ...

Springer Verlag2009

Compute-and-Forward: Harnessing Interference with Structured Codes

Michael Christoph Gastpar

For a centralized encoder and decoder, a channel matrix is simply a set of linear equations that can be transformed into parallel channels. We develop a similar approach to multiuser networks: we view interference as creating linear equations of codewords ...

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

A Web Survey for Facial Expressions Evaluation

Michel Bierlaire, Jean-Philippe Thiran, Matteo Sorci, Gianluca Antonini

In the recent years, researchers have investigated several methods of facial expression analysis. Their interest has been to apply their algorithms to sets of images labelled by a restrained number of experts. In order to deal with the generalizability of ...

2008

Broadcast and Slepian-Wolf multicast over Aref Networks

Satish Babu Korada, Dinkar Vasudevan

We consider source coding over Aref networks. In particular we consider the following two problems: (i) multicasting correlated sources to a set of receivers, (ii) broadcasting sources to their respective receivers. For the first problem we show necessary ...

2008

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper provides new results on computing simultaneous sparse approximations of multichannel signals over redundant dictionaries using two greedy algorithms. The first one, p-thresholding, selects the S atoms that have the largest

p

-correlation while ...

2008

Efficient Protocols for Set Membership and Range Proofs

Rafik Chaabouni

We consider the following problem: Given a commitment to a value σ, prove in zero-knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or clubs; often Φ can be a numerical range such as [1, 220]. This problem arises in ...

Springer2008

A multiresolution approach to automated classification of protein subcellular location images

Yann Barbotin, Amina Chebira

Fluorescence microscopy is widely used to determine the subcellular location of proteins. Efforts to determine location on a proteome-wide basis create a need for automated methods to analyze the resulting images. Over the past ten years, the feasibility o ...

BioMed Central2007

A geometric framework for solving subsequence problems in computational biology efficiently

Friedrich Eisenbrand

In this paper, we introduce the notion of a constrained Minkowski sumwhich for two (finite) point-sets P,Q R2 and a set of k inequalities Ax b is defined as the point-set (P Q)Ax b= x = p+q | P, q Q, Ax b. We show that typical subsequ ...

ACM2007

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

Graph Chatbot

Chat with Graph Search

A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows

A property of Bp(G). Applications to convolution operators

On the weakest failure detector ever

Compute-and-Forward: Harnessing Interference with Structured Codes

A Web Survey for Facial Expressions Evaluation

Broadcast and Slepian-Wolf multicast over Aref Networks

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

Efficient Protocols for Set Membership and Range Proofs

A multiresolution approach to automated classification of protein subcellular location images

A geometric framework for solving subsequence problems in computational biology efficiently

A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows

On the weakest failure detector ever

Compute-and-Forward: Harnessing Interference with Structured Codes

A Web Survey for Facial Expressions Evaluation

Broadcast and Slepian-Wolf multicast over Aref Networks

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

A geometric framework for solving subsequence problems in computational biology efficiently

Efficient Protocols for Set Membership and Range Proofs

A multiresolution approach to automated classification of protein subcellular location images

A property of Bp(G). Applications to convolution operators