Sciweavers

5606 search results - page 1040 / 1122
» Randomization Techniques for Graphs.
Sort
View
SIGSOFT
2010
ACM
14 years 7 months ago
Finding latent performance bugs in systems implementations
Robust distributed systems commonly employ high-level recovery mechanisms enabling the system to recover from a wide variety of problematic environmental conditions such as node f...
Charles Edwin Killian, Karthik Nagaraj, Salman Per...
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 5 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
SIAMMAX
2010
116views more  SIAMMAX 2010»
14 years 4 months ago
Structured Total Maximum Likelihood: An Alternative to Structured Total Least Squares
Abstract. Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total l...
Amir Beck, Yonina C. Eldar
TASLP
2010
150views more  TASLP 2010»
14 years 4 months ago
Diffuse Reverberation Model for Efficient Image-Source Simulation of Room Impulse Responses
Abstract-- In many research fields of engineering and acoustics, the image-source model represents one of the most popular tools for the simulation of sound fields in virtual rever...
Eric A. Lehmann, Anders M. Johansson
TIT
2010
111views Education» more  TIT 2010»
14 years 4 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
« Prev « First page 1040 / 1122 Last » Next »