1326 search results - page 101 / 266 » Approximate Tree Kernels |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
TSP
2010
13 years 3 months ago
2010
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
TAMC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
SPIRE
2009
Springer
14 years 3 months ago
2009
Springer
We introduce two new index structures based on the q-gram index. The new structures index substrings of variable length instead of q-grams of fixed length. For both of the new ind...