Sciweavers

817 search results - page 112 / 164
» Exact solutions to linear programming problems
Sort
View
TIT
2010
130views Education» more  TIT 2010»
14 years 9 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
129
Voted
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 11 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
ICALP
2004
Springer
15 years 7 months ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson
163
Voted
WSC
2008
15 years 4 months ago
Optimizing portfolio tail measures: Asymptotics and efficient simulation optimization
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
Sandeep Juneja
102
Voted
ET
2006
55views more  ET 2006»
15 years 2 months ago
Test Planning and Test Resource Optimization for Droplet-Based Microfluidic Systems
Recent years have seen the emergence of dropletbased microfluidic systems for safety-critical biomedical applications. In order to ensure reliability, microsystems incorporating m...
Fei Su, Sule Ozev, Krishnendu Chakrabarty