7015 search results - page 428 / 1403 » Approximation algorithms for co-clustering |
200
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
235
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
241
click to vote
EDBT
2012
ACM
13 years 9 months ago
2012
ACM
Record linkage analysis, which matches records referring to the same real world entities from different data sets, is an important task in data integration. Uncertainty often exi...
161
click to vote
VLSID
2007
IEEE
16 years 7 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
161
click to vote
ESANN
2004
15 years 8 months ago
2004
Abstract. In many situations, high dimensional data can be considered as sampled functions. We show in this paper how to implement a Self-Organizing Map (SOM) on such data by appro...