1060 search results - page 168 / 212 » Notes on Coding Theory |
108
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
CHI
2004
ACM
15 years 10 months ago
2004
ACM
A new interactive floorspace has been developed which uses modular nodes connected together to create a pressuresensitive area of varying size and shape, giving it the potential t...
199
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement ...
168
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
106
click to vote
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...