Sciweavers

153 search results - page 30 / 31
» On the Optimal Compression of Sets in PSPACE
Sort
View
JCP
2007
118views more  JCP 2007»
13 years 5 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
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...
Su Chen, Antonio Nucci
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 5 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
PERCOM
2003
ACM
14 years 4 months ago
Location Aware Resource Management in Smart Homes
Abstract-- The rapid advances in a wide range of wireless access technologies along with the efficient use of smart spaces have already set the stage for development of smart homes...
Abhishek Roy, Soumya K. Das Bhaumik, Amiya Bhattac...
MM
2010
ACM
251views Multimedia» more  MM 2010»
13 years 5 months ago
A cognitive approach for effective coding and transmission of 3D video
Reliable delivery of 3D video contents to a wide set of users is expected to be the next big revolution in multimedia applications provided that it is possible to grant a certain ...
Simone Milani, Giancarlo Calvagno
SPAA
2010
ACM
13 years 5 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis