Sciweavers

6110 search results - page 190 / 1222
» Approximate Computing
Sort
View
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 6 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
DCC
2004
IEEE
16 years 6 months ago
Predicting Wavelet Coefficients Over Edges Using Estimates Based on Nonlinear Approximants
It is well-known that wavelet transforms provide sparse decompositions over many types of image regions but not over image singularities/edges that manifest themselves along curve...
Onur G. Guleryuz
ACIVS
2008
Springer
16 years 26 days ago
Sub-optimal Camera Selection in Practical Vision Networks through Shape Approximation
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
Huang Lee, Linda Tessens, Marleen Morbée, H...
ICON
2007
IEEE
16 years 24 days ago
An Approximate Analysis of the Balance among Performance, Utilization and Power Estimation of Server Systems by Use of the Batch
- In this paper we analyze the performance, utilization, and power estimation of server systems by both adopting the batch service and adjusting the batch size. In addition to redu...
Ying-Wen Bai, Yung-Sen Cheng, Cheng-Hung Tsai
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 12 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng