Sciweavers

2983 search results - page 425 / 597
» The group marriage problem
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 9 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
CHI
2007
ACM
14 years 9 months ago
Sharing a single expert among multiple partners
Expertise to assist people on complex tasks is often in short supply. One solution to this problem is to design systems that allow remote experts to help multiple people in simult...
Jeffrey Wong, Lui Min Oh, Jiazhi Ou, Carolyn Penst...
CHI
2007
ACM
14 years 9 months ago
Investigating attractiveness in web user interfaces
A theoretical framework for assessing the attractiveness of websites based on Adaptive Decision Making theory is introduced. The framework was developed into a questionnaire and u...
Jan Hartmann, Alistair G. Sutcliffe, Antonella De ...
CHI
2006
ACM
14 years 9 months ago
Using intelligent task routing and contribution review to help communities build artifacts of lasting value
Many online communities are emerging that, like Wikipedia, bring people together to build community-maintained artifacts of lasting value (CALVs). Motivating people to contribute ...
Dan Cosley, Dan Frankowski, Loren G. Terveen, John...
CHI
2006
ACM
14 years 9 months ago
Keeping up appearances: understanding the dimensions of incidental information privacy
We conducted a survey of 155 participants to examine privacy concerns relating to the viewing of incidental information (i.e. traces of previous activity unrelated to the task at ...
Kirstie Hawkey, Kori M. Inkpen