Sciweavers

353 search results - page 56 / 71
» A genetic algorithm approach to the selection of near-optima...
Sort
View
SIGMOD
2010
ACM
213views Database» more  SIGMOD 2010»
14 years 1 months ago
On active learning of record matching packages
We consider the problem of learning a record matching package (classifier) in an active learning setting. In active learning, the learning algorithm picks the set of examples to ...
Arvind Arasu, Michaela Götz, Raghav Kaushik
CGI
1998
IEEE
14 years 22 days ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
ICCBR
2003
Springer
14 years 1 months ago
An Empirical Analysis of Linear Adaptation Techniques for Case-Based Prediction
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...
Colin Kirsopp, Emilia Mendes, Rahul Premraj, Marti...
BMCBI
2007
145views more  BMCBI 2007»
13 years 8 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...
BMCBI
2010
158views more  BMCBI 2010»
13 years 8 months ago
Validation of differential gene expression algorithms: Application comparing fold-change estimation to hypothesis testing
Background: Sustained research on the problem of determining which genes are differentially expressed on the basis of microarray data has yielded a plethora of statistical algorit...
Corey M. Yanofsky, David R. Bickel