429 search results - page 47 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
JEA
2006
14 years 9 months ago
2006
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
COMPGEOM
2009
ACM
15 years 2 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
Coupling the periodic time-invariance of the wavelet transform with the view of thresholding as a projection yields a simple, recursive, wavelet-based technique for denoising sign...
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...