338 search results - page 19 / 68 » Approximation Spaces and Information Granulation |
115
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
115
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
100
Voted
IM
2006
15 years 1 months ago
2006
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
100
click to vote
JMIV
2006
15 years 1 months ago
2006
Abstract - Certain structure detection problems can be solved by sampling a parameter space for the different structures at a finite number of points and checking each point to see...
119
click to vote
JCP
2007
15 years 1 months ago
2007
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...