Sciweavers

308 search results - page 43 / 62
» Tight Lower Bounds for the Distinct Elements Problem
Sort
View
TSP
2011
142views more  TSP 2011»
14 years 4 months 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...
PODC
2005
ACM
15 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
92
Voted
CIAC
1997
Springer
111views Algorithms» more  CIAC 1997»
15 years 1 months ago
A Meticulous Analysis of Mergesort Programs
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
Jyrki Katajainen, Jesper Larsson Träff
DCC
2006
IEEE
15 years 9 months ago
Analysis of Multiple Antenna Systems with Finite-Rate Feedback Using High Resolution Quantization Theory
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
Jun Zheng, Ethan R. Duni, Bhaskar D. Rao
RANDOM
1998
Springer
15 years 1 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev