Sciweavers

4908 search results - page 899 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
BMCBI
2006
201views more  BMCBI 2006»
14 years 12 months ago
Gene selection algorithms for microarray data based on least squares support vector machine
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
BMCBI
2006
138views more  BMCBI 2006»
14 years 12 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
BMCBI
2007
145views more  BMCBI 2007»
14 years 12 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
IJCSA
2008
237views more  IJCSA 2008»
14 years 12 months ago
Development of A SOLAP Patrimony Management Application System: Fez Medina as a Case Study
It is well known that transactional and analytical systems each require different database architecture. In general, the database structure of transactional systems is optimized f...
I. Salam, M. El Mohajir, A. Taleb, B. El Mohajir
CN
2007
111views more  CN 2007»
14 years 12 months ago
An auction mechanism for allocating the bandwidth of networks to their users
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
Manos Dramitinos, George D. Stamoulis, Costas Cour...