7006 search results - page 619 / 1402 » Approximation Algorithms |
217
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
208
click to vote
FTDB
2011
14 years 10 months ago
2011
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
196
click to vote
INFORMATICALT
2010
15 years 5 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
198
click to vote
GD
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
184
click to vote
IJON
2007
15 years 7 months ago
2007
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...