1106 search results - page 95 / 222 » On regularization algorithms in learning theory |
246
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
142
Voted
SIAMJO
2002
15 years 4 months ago
2002
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
165
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
This paper is concerned with the generalization ability of learning to rank algorithms for information retrieval (IR). We point out that the key for addressing the learning proble...
243
click to vote
Book
"Pattern recognition techniques are concerned with the theory and algorithms of putting abstract objects, e.g., measurements made on physical objects, into categories. Typical...
147
click to vote
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...