3415 search results - page 165 / 683 » Lower Bounds for Kernelizations |
125
click to vote
EOR
2007
15 years 4 months ago
2007
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
139
click to vote
ALGORITHMICA
2005
15 years 4 months ago
2005
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
128
click to vote
DCC
2000
IEEE
15 years 4 months ago
2000
IEEE
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
161
Voted
SODA
2010
ACM
15 years 3 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
159
click to vote
GLOBECOM
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...