5169 search results - page 420 / 1034 » Locality approximation using time |
179
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
157
click to vote
COLT
2004
Springer
16 years 9 days ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
172
click to vote
IJCAI
2003
15 years 8 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
182
click to vote
WAOA
2005
Springer
16 years 11 days ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
188
click to vote
BMVC
2010
15 years 4 months ago
2010
We present an approach for active segmentation based on integration of several cues. It serves as a framework for generation of object hypotheses of previously unseen objects in n...