Sciweavers

3208 search results - page 534 / 642
» A Lower Bound for Primality
Sort
View
180
Voted
HPDC
2010
IEEE
15 years 5 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
153
Voted
ICASSP
2010
IEEE
15 years 5 months ago
Utilizing principal singular vectors for two-dimensional single frequency estimation
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...
H. C. So, Frankie K. W. Chan, C. F. Chan, W. H. La...
149
Voted
AHSWN
2008
92views more  AHSWN 2008»
15 years 5 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
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...
Amit Dvir, Michael Segal
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
15 years 5 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
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...
Yossi Azar, Uriel Feige, Daniel Glasner
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
15 years 5 months ago
On Covering Problems of Rado
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 ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang