Sciweavers

251 search results - page 41 / 51
» Distributed algorithms for edge dominating sets
Sort
View
81
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
EVOW
2006
Springer
15 years 1 months ago
A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
Matthieu Basseur, Eckart Zitzler
SAC
2011
ACM
14 years 16 days ago
ImageAlert: credibility analysis of text-image pairs on the web
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...
Yusuke Yamamoto, Katsumi Tanaka
PDPTA
2003
14 years 11 months ago
Tuxedo: A Peer-to-Peer Caching System
We are witnessing two trends in Web content access: (a) increasing amounts of dynamic and personalized Web content, and (b) a significant growth in “on-the-move” access using...
Weisong Shi, Kandarp Shah, Yonggen Mao, Vipin Chau...
89
Voted
IWQOS
2001
Springer
15 years 2 months ago
Dynamic Core Provisioning for Quantitative Differentiated Service
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
Raymond R.-F. Liao, Andrew T. Campbell