Sciweavers

3875 search results - page 469 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
153
Voted
GECCO
2009
Springer
16 years 1 months ago
An evolutionary approach to planning IEEE 802.16 networks
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf, Rob...
INFOCOM
2005
IEEE
16 years 9 days ago
Achieving minimum-cost multicast: a decentralized approach based on network coding
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, M...
196
Voted
PCM
2004
Springer
144views Multimedia» more  PCM 2004»
16 years 1 days ago
Dynamic Programming Based Adaptation of Multimedia Contents in UMA
Content adaptation is an effective solution to support the quality of service for multimedia services over heterogeneous networks. This paper deals with the accuracy and the real-...
Truong Cong Thang, Yong Ju Jung, Yong Man Ro
COMPGEOM
2003
ACM
15 years 12 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 10 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos