Sciweavers

10715 search results - page 1998 / 2143
» From Tests to Proofs
Sort
View
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
14 years 8 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
CHI
2008
ACM
14 years 8 months ago
Optimal parameters for efficient crossing-based dialog boxes
We present an empirical analysis of crossing-based dialog boxes. First, we study the spatial constraints required for efficient crossing-based interactions in the case of a simple...
Morgan Dixon, François Guimbretière,...
CHI
2008
ACM
14 years 8 months ago
Improving the performance of motor-impaired users with automatically-generated, ability-based interfaces
We evaluate two systems for automatically generating personalized interfaces adapted to the individual motor capabilities of users with motor impairments. The first system, SUPPLE...
Krzysztof Z. Gajos, Jacob O. Wobbrock, Daniel S. W...
CHI
2007
ACM
14 years 8 months ago
Hard lessons: effort-inducing interfaces benefit spatial learning
Interface designers normally strive for a design that minimises the user's effort. However, when the design's objective is to train users to interact with interfaces tha...
Andy Cockburn, Per Ola Kristensson, Jason Alexande...
« Prev « First page 1998 / 2143 Last » Next »