995 search results - page 83 / 199 » Learning Useful Horn Approximations |
108
click to vote
CEAS
2006
Springer
15 years 4 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
121
click to vote
NIPS
1990
15 years 1 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
TIT
1998
15 years 9 days ago
1998
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
103
Voted
ECCV
2002
Springer
16 years 2 months ago
2002
Springer
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
90
Voted
AI
2001
Springer
15 years 5 months ago
2001
Springer
Reinforcement learning techniques are increasingly being used to solve di cult problems in control and combinatorial optimization with promising results. Implicit imitation can acc...