Sciweavers

536 search results - page 63 / 108
» The hardness and approximation algorithms for l-diversity
Sort
View
PSB
2004
13 years 9 months ago
Multiplexing Schemes for Generic SNP Genotyping Assays
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
Roded Sharan, Amir Ben-Dor, Zohar Yakhini
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
13 years 9 months ago
Using differential evolution for symbolic regression and numerical constant creation
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
Brian M. Cerny, Peter C. Nelson, Chi Zhou
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
ICC
2008
IEEE
114views Communications» more  ICC 2008»
14 years 2 months ago
Iterative DA/DD Channel Estimation for KSP-OFDM
—In this paper, we propose an iterative joint DA/DD channel estimation algorithm for known symbol padding (KSP) OFDM. The pilot symbols used to estimate the channel are not only ...
Dieter Van Welden, Heidi Steendam, Marc Moeneclaey