Sciweavers

4009 search results - page 212 / 802
» Clustering on Complex Graphs
Sort
View
DAM
2007
77views more  DAM 2007»
15 years 4 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
CLUSTER
2006
IEEE
15 years 10 months ago
Autonomic Management of Clustered Applications
Distributed software environments are increasingly complex and difficult to manage, as they integrate various legacy software with proprietary management interfaces. Moreover, th...
Sara Bouchenak, Noel De Palma, Daniel Hagimont, Ch...
ESANN
2008
15 years 5 months ago
Clustering of Self-Organizing Map
Abstract. In this paper, we present a new similarity measure for a clustering self-organizing map which will be reached using a new approach of hierarchical clustering. (1) The sim...
Hanane Azzag, Mustapha Lebbah
USENIX
2000
15 years 5 months ago
MOSIX: How Linux Clusters Solve Real-World Problems
As the complexity of software increases, the size of the software tends to increase as well, which incurs longer compilation and build cycles. In this paper, the authors present o...
Steve McClure, Richard Wheeler
ICC
2007
IEEE
15 years 10 months ago
Determination of Optimal Distortion-Based Protection in Progressive Image Transmission: a Heuristic Approach
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
Alessio Torquati, Maria Fresia, Fabio Lavagetto