1326 search results - page 189 / 266 » Approximate Tree Kernels |
129
Voted
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
146
Voted
SODA
2010
ACM
15 years 15 days ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
257
Voted
ICDE
2009
IEEE
16 years 4 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
138
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
We propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function ...
119
Voted
SMI
2005
IEEE
15 years 8 months ago
2005
IEEE
Complex implicit CSG models can be represented hierarchically as a tree of nodes (the BlobTree) . However, current methods cannot be used to visualize changes made to these models...