2430 search results - page 344 / 486 » Computing Tutte Polynomials |
128
Voted
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
195
Voted
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
143
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
121
Voted
MOBIHOC
2003
ACM
16 years 3 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
144
Voted
ALT
2004
Springer
16 years 15 days ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...