1326 search results - page 44 / 266 » Approximate Tree Kernels |
115
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
137
Voted
DAM
2000
15 years 1 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
112
click to vote
COCOON
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
142
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
162
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...