3656 search results - page 124 / 732 » Compact Location Problems |
108
click to vote
JCO
2007
15 years 20 days ago
2007
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
117
Voted
SIAMJO
2010
14 years 7 months ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
NIPS
2003
15 years 2 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
114
click to vote
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...
82
Voted
ALGORITHMICA
2000
15 years 18 days ago
2000
We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x, y [0, 1] with as little uncertain...