7015 search results - page 366 / 1403 » Approximation algorithms for co-clustering |
172
click to vote
CAD
2004
Springer
15 years 6 months ago
2004
Springer
Given a nonsingular compact two-manifold F without boundary, we present methods for establishing a family of surfaces which can approximate F so that each approximant is ambient i...
163
click to vote
PVLDB
2008
15 years 6 months ago
2008
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
204
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
198
click to vote
ESA
2005
Springer
16 years 6 days ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
167
Voted
CIKM
2003
Springer
16 years 7 min ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...