1326 search results - page 177 / 266 » Approximate Tree Kernels |
132
click to vote
JMLR
2006
15 years 2 months ago
2006
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
102
Voted
SIAMSC
2008
15 years 2 months ago
2008
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...
117
Voted
MICCAI
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. In analyzing diffusion magnetic resonance imaging, multitensor models address the limitations of the single diffusion tensor in situations of partial voluming and fiber c...
115
Voted
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
137
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...