Sciweavers

5302 search results - page 994 / 1061
» Learning How to Separate
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 8 days ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
CHI
2006
ACM
16 years 7 days ago
The paradox of the assisted user: guidance can be counterproductive
This paper investigates the influence of interface styles on problem solving performance. It is often assumed that performance on problem solving tasks improves when users are ass...
Christof van Nimwegen, Daniel D. Burgos, Herre van...
MOBISYS
2006
ACM
15 years 11 months ago
Context-aware interactive content adaptation
Automatic adaptation of content for mobile devices is a challenging problem because optimal adaptation often depends on the usage semantics of content, as well as the context of u...
Iqbal Mohomed, Jim Chengming Cai, Sina Chavoshi, E...
CIKM
2009
Springer
15 years 6 months ago
Mining linguistic cues for query expansion: applications to drug interaction search
Given a drug under development, what are other drugs or biochemical compounds that it might interact with? Early answers to this question, by mining the literature, are valuable f...
Sheng Guo, Naren Ramakrishnan
ECTEL
2009
Springer
15 years 6 months ago
Distributed Awareness for Class Orchestration
The orchestration process consists of managing classroom interactions at multiple levels: individual activities, teamwork and class-wide sessions. We study the process of orchestra...
Hamed S. Alavi, Pierre Dillenbourg, Fréd&ea...