7006 search results - page 422 / 1402 » Approximation Algorithms |
142
Voted
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
A directional spatial relationship to a reference object (e.g., "east of the post office") can be represented by a spatial template. The template partitions the space in...
123
click to vote
ICCBR
2005
Springer
15 years 10 months ago
2005
Springer
Traditional CBR approaches imply centralized storage of the case base and, most of them, the retrieval of similar cases by an exhaustive comparison of the case to be solved with th...
163
click to vote
JCO
2008
15 years 4 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
126
click to vote
DAM
1999
15 years 4 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
131
Voted
JMIV
2002
15 years 4 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...