Sciweavers

653 search results - page 59 / 131
» The size of minimum 3-trees
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
16 years 1 months ago
Finding Time-Lagged 3D Clusters
Existing 3D clustering algorithms on gene ? sample ? time expression data do not consider the time lags between correlated gene expression patterns. Besides, they either ignore the...
Xin Xu, Ying Lu, Kian-Lee Tan, Anthony K. H. Tung
MOBICOM
2006
ACM
15 years 5 months ago
Optimal CWmin selection for achieving proportional fairness in multi-rate 802.11e WLANs: test-bed implementation and evaluation
We investigate the optimal selection of minimum contention window values to achieve proportional fairness in a multirate IEEE 802.11e test-bed. Unlike other approaches, the propos...
Vasilios A. Siris, George Stamatakis
FOCS
2004
IEEE
15 years 3 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
DAM
2007
177views more  DAM 2007»
14 years 11 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
MFCS
2007
Springer
15 years 6 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda