3415 search results - page 572 / 683 » Lower Bounds for Kernelizations |
135
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, frequency estimation of a twodimensional (2D) cisoid in the presence of additive white Gaussian noise is addressed. By utilizing the rank-one property of the 2D noi...
131
click to vote
AHSWN
2008
15 years 4 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
134
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
121
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
141
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...