Sciweavers

968 search results - page 93 / 194
» Evaluating Benchmark Subsetting Approaches
Sort
View
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
14 years 4 months ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
EUROPAR
2009
Springer
15 years 8 months ago
Process Mapping for MPI Collective Communications
It is an important problem to map virtual parallel processes to physical processors (or cores) in an optimized way to get scalable performance due to non-uniform communication cost...
Jin Zhang, Jidong Zhai, Wenguang Chen, Weimin Zhen...
EUROSYS
2006
ACM
15 years 10 months ago
Database replication policies for dynamic content applications
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
Gokul Soundararajan, Cristiana Amza, Ashvin Goel
BMCBI
2008
172views more  BMCBI 2008»
15 years 1 months ago
Compo: composite motif discovery using discrete models
Background: Computational discovery of motifs in biomolecular sequences is an established field, with applications both in the discovery of functional sites in proteins and regula...
Geir Kjetil Sandve, Osman Abul, Finn Drablø...
BMCBI
2006
201views more  BMCBI 2006»
15 years 1 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