241 search results - page 18 / 49 » Fast heuristics for large scale covering-location problems |
ICOIN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
69
Voted
INTERWORKING
2000
15 years 1 months ago
2000
In a packet switching based scenario, optical technologies can not completely overcome the problem of insufficient network capacity, due to limitations produced by the presence of ...
82
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
78
Voted
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
2010
Eurographics
Interpolating vertex positions among triangle meshes with identical vertex-edge graphs is a fundamental part of many geometric modelling systems. Linear vertex interpolation is ro...