Sciweavers

2440 search results - page 451 / 488
» Learn .MT: A New Approach to Incremental Learning
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 6 days ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
CHI
2010
ACM
15 years 6 months ago
Experience in social affective applications: methodologies and case study
New forms of social affective applications are emerging, bringing with them challenges in design and evaluation. We report on one such application, conveying wellbeing for both pe...
Paul André, m. c. schraefel, Alan J. Dix, R...
IUI
2010
ACM
15 years 6 months ago
Automatically identifying targets users interact with during real world tasks
Information about the location and size of the targets that users interact with in real world settings can enable new innovations in human performance assessment and software usab...
Amy Hurst, Scott E. Hudson, Jennifer Mankoff
CP
2009
Springer
15 years 6 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
CLUSTER
2009
IEEE
15 years 6 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...