Sciweavers

1429 search results - page 107 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
PVLDB
2010
134views more  PVLDB 2010»
13 years 7 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 2 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
JNW
2006
88views more  JNW 2006»
13 years 9 months ago
A Genetic Algorithms Based Approach for Group Multicast Routing
Whereas multicast transmission in one-to-many communications allows the operator to drastically save network resources, it also makes the routing of the traffic flows more complex ...
Luca Sanna Randaccio, Luigi Atzori
OTM
2005
Springer
14 years 2 months ago
Peer-to-Peer Distribution Architectures Providing Uniform Download Rates
Peer-to-peer (P2P) networks have proved to be a powerful and highly scalable alternative to traditional client-server architectures for content distribution. They offer the techni...
Marc Schiely, Pascal Felber