Sciweavers

1326 search results - page 132 / 266
» Approximate Tree Kernels
Sort
View
TALG
2010
110views more  TALG 2010»
15 years 25 days ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
IPL
2006
97views more  IPL 2006»
15 years 2 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
JMLR
2010
118views more  JMLR 2010»
14 years 9 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
CGI
2003
IEEE
15 years 6 months ago
Reaching Volumes Generated by Means of Octal Trees and Cartesian Constraints
This paper presents a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certa...
I. Rodríguez, Manuel Peinado, Ronan Boulic,...
98
Voted
NIPS
2007
15 years 3 months ago
Learning with Tree-Averaged Densities and Distributions
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
Sergey Kirshner