Sciweavers

3946 search results - page 429 / 790
» The computational complexity of choice sets
Sort
View
ICPR
2002
IEEE
16 years 8 months ago
Context-Sensitive Bayesian Classifiers and Application to Mouse Pressure Pattern Classification
In this paper, we propose a new context-sensitive Bayesian learning algorithm. By modeling the distributions of data locations by a mixture of Gaussians, the new algorithm can uti...
Yuan (Alan) Qi, Rosalind W. Picard
ICML
2005
IEEE
16 years 8 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi
SPAA
2009
ACM
16 years 8 months ago
Mapping filtering streaming applications with communication costs
In this paper, we explore the problem of mapping filtering streaming applications on large-scale homogeneous platforms, with a particular emphasis on communication models and thei...
Kunal Agrawal, Anne Benoit, Fanny Dufossé, ...
CHI
2005
ACM
16 years 8 months ago
Automatic generation of high coverage usability tests
Software systems are often complex in the number of features that are available through the user interface and consequently, the number of interactions that can occur. Such system...
Renée C. Bryce
CHI
2003
ACM
16 years 8 months ago
Persona development for information-rich domains
Designing information architecture for complex websites requires understanding user information needs and mental models in that domain. Personas, or user archetypes, created for s...
Rashmi R. Sinha