Sciweavers

4698 search results - page 327 / 940
» Making Functionality More General
Sort
View
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
16 years 5 months ago
Information theoretic regularization for semi-supervised boosting
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labele...
Lei Zheng, Shaojun Wang, Yan Liu, Chi-Hoon Lee
ICFP
2006
ACM
16 years 4 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
127
Voted
IUI
2010
ACM
16 years 1 months ago
Towards intelligent motion inferencing in mathematical sketching
We present a new approach for creating dynamic illustrations to assist in the understanding of concepts in physics and mathematics using pen-based interaction. Our approach builds...
Salman Cheema, Joseph J. LaViola Jr.
CSCLP
2007
Springer
15 years 11 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
INFOCOM
2006
IEEE
15 years 10 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely