1279 search results - page 161 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
WWW
2007
ACM
14 years 9 months ago
2007
ACM
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
TKDE
2012
11 years 11 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
ICDT
2010
ACM
14 years 1 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
COMPGEOM
2011
ACM
13 years 16 days ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...