1326 search results - page 42 / 266 » Approximate Tree Kernels |
122
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
138
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
141
Voted
INFOCOM
2010
IEEE
15 years 9 days ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
108
click to vote
SIGMETRICS
2004
ACM
15 years 7 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
101
click to vote
AAAI
2008
15 years 4 months ago
2008
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...