6315 search results - page 32 / 1263 » Approximating Solution Structure |
158
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
77
Voted
ICDE
2010
IEEE
16 years 15 days ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
105
click to vote
ECCV
2004
Springer
16 years 2 months ago
2004
Springer
This paper proposes a robust estimation and validation framework for characterizing local structures in a positive multi-variate continuous function approximated by a Gaussian-base...
107
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
111
click to vote
CEC
2008
IEEE
15 years 2 months ago
2008
IEEE
This paper proposes an approach to the solution of multi-objective optimisation problems that delivers a single, preferred solution. A conventional, population-based, multiobjectiv...