Sciweavers

31 search results - page 6 / 7
» What makes categories difficult to classify
Sort
View
IPPS
1998
IEEE
13 years 10 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
SIGIR
2008
ACM
13 years 6 months ago
Learning from labeled features using generalized expectation criteria
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
Gregory Druck, Gideon S. Mann, Andrew McCallum
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
14 years 6 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
ITICSE
2006
ACM
14 years 6 days ago
ASSISTing CS1 students to learn: learning approaches and object-oriented programming
Identifying and managing students who experience difficulty with learning to program is a challenge for CS educators. In an attempt to answer the familiar question “What makes f...
Janet Hughes, D. Ramanee Peiris
IUI
2006
ACM
14 years 6 days ago
A cognitively based approach to affect sensing from text
Studying the relationship between natural language and affective information as well as assessing the underpinned affective qualities of natural language are becoming crucial for ...
Shaikh Mostafa Al Masum, Helmut Prendinger, Mitsur...