Sciweavers

4757 search results - page 642 / 952
» Generalized Posynomial Performance Modeling
Sort
View
174
Voted
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
16 years 7 months ago
Regularized multi--task learning
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
Theodoros Evgeniou, Massimiliano Pontil
131
Voted
CHI
2004
ACM
16 years 7 months ago
The temporal aspects of work for HCI
The general aim of the workshop is to explore the temporal aspects of work for Human-Computer Interaction (HCI). This position paper attempts to contribute to the exploration by p...
Peter J. Wild, Peter Johnson, Chris Roast, Mary Cz...
CADE
2001
Springer
16 years 7 months ago
Context Trees
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
16 years 6 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang