2698 search results - page 259 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
168
click to vote
NIPS
2007
15 years 8 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
195
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
214
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
159
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
155
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...