4498 search results - page 147 / 900 » How to Invent Functions |
122
click to vote
COLT
2001
Springer
15 years 7 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
145
click to vote
PEPM
1994
ACM
15 years 6 months ago
1994
ACM
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
113
Voted
CTRSA
2006
Springer
15 years 6 months ago
2006
Springer
A series of recent papers have demonstrated collision attacks on popularly used hash functions, including the widely deployed MD5 and SHA-1 algorithm. To assess this threat, the na...
121
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We propose a notion of a stable partition in a coalitional game that is parametrized by the concept of a defection function. This function assigns to each partition of the grand c...