Sciweavers

JMLR
2012
11 years 8 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
CP
2011
Springer
12 years 5 months ago
Optimal Carpet Cutting
Abstract. In this paper we present a model for the carpet cutting problem in which carpet shapes are cut from a rectangular carpet roll with a fixed width and sufficiently long le...
Andreas Schutt, Peter J. Stuckey, Andrew R. Verden
ICASSP
2011
IEEE
12 years 9 months ago
Optimum multi-user detection by nonsmooth optimization
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
Hoang Duong Tuan, Tran Thai Son, Hoang Tuy, Ha H. ...
TSP
2010
13 years 12 days ago
Code design for radar STAP via optimization theory
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
SIAMCO
2010
103views more  SIAMCO 2010»
13 years 14 days ago
On Some Systems Controlled by the Structure of Their Memory
We consider an optimal control problem governed by an ODE with memory playing the role of a control. We show the existence of an optimal solution and derive some necessary optimal...
G. Buttazzo, G. Carlier, R. Tahraoui
TSP
2011
142views more  TSP 2011»
13 years 20 days ago
Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
Antonio De Maio, Yongwei Huang, Daniel Pére...
DAM
2011
13 years 21 days ago
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle s...
Géraldine Heilporn, Jean-François Co...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 2 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
GLOBECOM
2009
IEEE
13 years 3 months ago
Minimum-Length Scheduling for Multicast Traffic under Channel Uncertainty
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
Anna Pantelidou, Anthony Ephremides
EACL
2009
ACL Anthology
13 years 3 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud