Sciweavers

1632 search results - page 266 / 327
» On special numberings of hypergraphs
Sort
View
JSAC
2007
120views more  JSAC 2007»
15 years 6 months ago
On the Capacity of MIMO Wireless Channels with Dynamic CSIT
Abstract— Transmit channel side information (CSIT) can significantly increase MIMO wireless capacity. Due to delay in acquiring this information, however, the time-selective fad...
Mai Vu, Arogyaswami Paulraj
BMCBI
2004
136views more  BMCBI 2004»
15 years 6 months ago
A SNP-centric database for the investigation of the human genome
Background: Single Nucleotide Polymorphisms (SNPs) are an increasingly important tool for genetic and biomedical research. Although current genomic databases contain information o...
Alberto Riva, Isaac S. Kohane
TEC
2002
161views more  TEC 2002»
15 years 6 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...
VLDB
2002
ACM
137views Database» more  VLDB 2002»
15 years 6 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
RSA
2008
123views more  RSA 2008»
15 years 5 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang