3894 search results - page 441 / 779 » Approximation Algorithms for Biclustering Problems |
147
click to vote
FAW
2009
Springer
15 years 11 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
129
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
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...
157
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
163
click to vote
PCM
2004
Springer
15 years 10 months ago
2004
Springer
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-...
156
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
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...