Sciweavers

2617 search results - page 269 / 524
» Adaptive local ratio
Sort
View
WMPI
2004
ACM
16 years 6 days ago
Selective main memory compression by identifying program phase changes
During a program’s runtime, the stack and data segments of the main memory often contain much redundancy, which makes them good candidates for compression. Compression and decomp...
Doron Nakar, Shlomo Weiss
FSTTCS
2001
Springer
15 years 11 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
ALGOSENSORS
2007
Springer
15 years 10 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
APGV
2007
ACM
115views Visualization» more  APGV 2007»
15 years 10 months ago
A roughness measure for 3D mesh visual masking
3D models are subject to a wide variety of processing operations such as compression, simplification or watermarking, which introduce slight geometric modifications on the shape. ...
Guillaume Lavoué
AVSS
2007
IEEE
15 years 10 months ago
A LQR spatiotemporal fusion technique for face profile collection in smart camera surveillance
In this paper, we propose a joint face orientation estimation in smart camera networks without having to localize the cameras in advance. The system is composed of in-node coarse ...
Chung-Ching Chang, Hamid K. Aghajan