2698 search results - page 178 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
167
click to vote
COMPGEOM
2006
ACM
16 years 14 days ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
192
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
154
click to vote
CCCG
2008
15 years 8 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
198
click to vote
ESA
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
147
click to vote
PRL
2002
15 years 6 months ago
2002
Fuzzy rule based image segmentation techniques tend in general, to be application dependent with the structure of the membership functions being predefined and in certain cases, t...