Sciweavers

14761 search results - page 2852 / 2953
» Optimization in Data Mining
Sort
View
DLOG
2008
15 years 6 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
CLUSTER
2008
IEEE
15 years 6 months ago
Efficient one-copy MPI shared memory communication in Virtual Machines
Efficient intra-node shared memory communication is important for High Performance Computing (HPC), especially with the emergence of multi-core architectures. As clusters continue ...
Wei Huang, Matthew J. Koop, Dhabaleswar K. Panda
RECOMB
2010
Springer
15 years 6 months ago
naiveBayesCall: An Efficient Model-Based Base-Calling Algorithm for High-Throughput Sequencing
Immense amounts of raw instrument data (i.e., images of fluorescence) are currently being generated using ultra high-throughput sequencing platforms. An important computational cha...
Wei-Chun Kao, Yun S. Song
EDM
2008
97views Data Mining» more  EDM 2008»
15 years 6 months ago
Using Item-type Performance Covariance to Improve the Skill Model of an Existing Tutor
Using data from an existing pre-algebra computer-based tutor, we analyzed the covariance of item-types with the goal of describing a more effective way to assign skill labels to it...
Philip I. Pavlik, Hao Cen, Lili Wu, Kenneth R. Koe...
ICONIP
2007
15 years 6 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
« Prev « First page 2852 / 2953 Last » Next »