Sciweavers

1405 search results - page 58 / 281
» Popularity at Minimum Cost
Sort
View
JUCS
2007
148views more  JUCS 2007»
14 years 9 months ago
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
Adrian Dumitrescu, Csaba D. Tóth
HICSS
2005
IEEE
125views Biometrics» more  HICSS 2005»
15 years 3 months ago
A Preliminary Analysis of the Influences of Licensing and Organizational Sponsorship on Success in Open Source Projects
This paper develops and tests a model of the impact of licensing restrictiveness and organizational sponsorship on the popularity and vitality of open source software (OSS) develo...
Katherine J. Stewart, Anthony P. Ammeter, Likoebe ...
NOSSDAV
1993
Springer
15 years 1 months ago
Probabilistic Assignment of Movies to Storage Devices in a Video-On-Demand System
–A video-on-demand server must satisfy a large customer base and a diverse archive of movies under changing movie popularity and daily load peaks. These requirements must be sati...
Thomas D. C. Little, Dinesh Venkatesh
TON
2008
88views more  TON 2008»
14 years 9 months ago
Traffic modeling and proportional partial caching for peer-to-peer systems
Peer-to-peer (P2P) file sharing systems generate a major portion of the Internet traffic, and this portion is expected to increase in the future. We explore the potential of deploy...
Mohamed Hefeeda, Osama Saleh
COCOON
2005
Springer
15 years 3 months ago
Algorithms for Terminal Steiner Trees
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
Fábio Viduani Martinez, José Coelho ...