3475 search results - page 110 / 695 » Backbones in Optimization and Approximation |
141
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
180
click to vote
ADBIS
1994
Springer
15 years 10 months ago
1994
Springer
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
139
click to vote
ESANN
2006
15 years 7 months ago
2006
In this paper, the problem of an optimal transformation of the input space for function approximation problems is addressed. The transformation is defined determining the Mahalanob...
179
click to vote
WG
2007
Springer
16 years 12 days ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
173
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...