Sciweavers

432 search results - page 49 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 9 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
MOBICOM
2006
ACM
14 years 1 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
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
14 years 25 days ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
GLOBECOM
2007
IEEE
14 years 1 months ago
Ensemble Enumerators for Protograph-Based Generalized LDPC Codes
— Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. These advantages have also been exploited ...
Shadi Abu-Surra, William E. Ryan, Dariush Divsalar
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 7 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy