83 search results - page 11 / 17 » Extractors: optimal up to constant factors |
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
The typical workload in a database system consists of a mixture of multiple queries of different types, running concurrently and interacting with each other. Hence, optimizing per...