Sciweavers

3528 search results - page 648 / 706
» A New Approach to Planning in Networks
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 4 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
ICANN
2009
Springer
15 years 4 months ago
Modelling Image Complexity by Independent Component Analysis, with Application to Content-Based Image Retrieval
Abstract. Estimating the degree of similarity between images is a challenging task as the similarity always depends on the context. Because of this context dependency, it seems qui...
Jukka Perkiö, Aapo Hyvärinen
DATE
2008
IEEE
69views Hardware» more  DATE 2008»
15 years 4 months ago
Time Properties of the BuST Protocol under the NPA Budget Allocation Scheme
Token passing is a channel access technique used in several communication networks. Among them, one of the most effective solution for supporting both real-time traffic (synchron...
Gianluca Franchino, Giorgio C. Buttazzo, Tullio Fa...
DCC
2008
IEEE
15 years 4 months ago
Shared Descriptions Fusion Coding for Storage and Selective Retrieval of Correlated Sources
Motivated by sensor networks, we consider the fusion storage of correlated sources in a database, such that any subset of them may be efficiently retrieved in the future. Only st...
Sharadh Ramaswamy, Kenneth Rose
ICIP
2008
IEEE
15 years 4 months ago
Image representation by compressed sensing
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive...
Bing Han, Feng Wu, Dapeng Wu