1082 search results - page 81 / 217 » Approximation Algorithms for Spreading Points |
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
JCP
2007
13 years 7 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...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...