Sciweavers

188 search results - page 21 / 38
» Differentially Private Approximation Algorithms
Sort
View
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 9 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
ESIAT
2009
IEEE
13 years 5 months ago
An Image Mosaics Algorithm Based on Improved Phase Correlation
An image mosaics algorithm based on improved phase correlation is proposed in this paper. The improved phase correlation improves on the conventional phase correlation in three asp...
Zhang Jing, Wang Chang-shun, Liao Wu-ling
IJCV
2006
116views more  IJCV 2006»
13 years 7 months ago
Contextual Inference in Contour-Based Stereo Correspondence
Standard approaches to stereo correspondence have difficulty when scene structure does not lie in or near the frontal parallel plane, in part because an orientation disparity as we...
Gang Li, Steven W. Zucker
ICASSP
2011
IEEE
12 years 11 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
ICNP
2006
IEEE
14 years 1 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das