Sciweavers

16188 search results - page 3038 / 3238
» The Optimal PAC Algorithm
Sort
View
SPIRE
2010
Springer
15 years 4 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TCS
2010
15 years 4 months ago
On the complexities of consistency checking for restricted UML class diagrams
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
Ken Kaneiwa, Ken Satoh
TIP
2010
129views more  TIP 2010»
15 years 4 months ago
Selective Data Pruning-Based Compression Using High-Order Edge-Directed Interpolation
—This paper proposes a selective data pruning-based compression scheme to improve the rate-distortion relation of compressed images and video sequences. The original frames are p...
Dung Trung Vo, Joel Solé, Peng Yin, Cristin...
TKDE
2010
164views more  TKDE 2010»
15 years 4 months ago
PAM: An Efficient and Privacy-Aware Monitoring Framework for Continuously Moving Objects
—Efficiency and privacy are two fundamental issues in moving object monitoring. This paper proposes a privacy-aware monitoring (PAM) framework that addresses both issues. The fra...
Haibo Hu, Jianliang Xu, Dik Lun Lee
TMI
2010
112views more  TMI 2010»
15 years 4 months ago
Regularized Interpolation for Noisy Images
Abstract—Interpolation is the means by which a continuouslydefined model is fit to discrete data samples. When the data samples are exempt of noise, it seems desirable to build...
Sathish Ramani, Philippe Thévenaz, Michael ...
« Prev « First page 3038 / 3238 Last » Next »