Sciweavers

379 search results - page 25 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
A revisit to MRF-based depth map super-resolution and enhancement
This paper presents a Markov Random Field (MRF)-based approach for depth map super-resolution and enhancement. Given a low-resolution or moderate quality depth map, we study the p...
Jiangbo Lu, Dongbo Min, Ramanpreet Singh Pahwa, Mi...
WWW
2008
ACM
14 years 8 months ago
Anycast CDNS revisited
Because it is an integral part of the Internet routing apparatus, and because it allows multiple instances of the same service to be "naturally" discovered, IP Anycast h...
Hussein A. Alzoubi, Seungjoon Lee, Michael Rabinov...
ISQED
2009
IEEE
124views Hardware» more  ISQED 2009»
14 years 2 months ago
Revisiting the linear programming framework for leakage power vs. performance optimization
— This paper revisits and extends a general linear programming(LP) formulation to exploit multiple knobs such as multi-Lgate footprint-compatible libraries and post-layout Lgateb...
Kwangok Jeong, Andrew B. Kahng, Hailong Yao
PAM
2009
Springer
14 years 2 months ago
Revisiting Route Caching: The World Should Be Flat
Internet routers’ forwarding tables (FIBs), which must be stored in expensive fast memory for high-speed packet forwarding, are growing quickly in size due to increased multihomi...
Changhoon Kim, Matthew Caesar, Alexandre Gerber, J...
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 1 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma