458 search results - page 68 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
172
click to vote
ISPAN
2002
IEEE
15 years 8 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
171
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
151
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
108
Voted
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
143
Voted
SAMOS
2009
Springer
15 years 10 months ago
2009
Springer
Tomography is a powerful technique for three-dimensional imaging, that deals with image reconstruction from a series of projection images, acquired along a range of viewing directi...