1193 search results - page 165 / 239 » A primer of simple theories |
189
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
160
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
154
click to vote
DEXAW
2000
IEEE
15 years 10 months ago
2000
IEEE
Given their simple nature, the success of keyword based retrieval systems is astonishing. Although these methods seemingly only process words (and their word counts), they rely on...
162
click to vote
CIKM
2000
Springer
15 years 10 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
195
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...