1091 search results - page 74 / 219 » Approximation Algorithms for Data Placement Problems |
VLSID
2007
IEEE
14 years 8 months ago
2007
IEEE
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
ICIP
2010
IEEE
2010
IEEE
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
13 years 5 months ago
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
JMLR
2008
13 years 7 months ago
2008
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...