Sciweavers

1450 search results - page 183 / 290
» Fitness Uniform Optimization
Sort
View
FOCS
2008
IEEE
14 years 5 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
COLT
2008
Springer
14 years 18 days ago
Adaptive Hausdorff Estimation of Density Level Sets
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...
Aarti Singh, Robert Nowak, Clayton Scott
VLSID
2006
IEEE
148views VLSI» more  VLSID 2006»
14 years 11 months ago
Efficient Design and Analysis of Robust Power Distribution Meshes
With increasing design complexity, as well as continued scaling of supplies, the design and analysis of power/ground distribution networks poses a difficult problem in modern IC d...
Puneet Gupta, Andrew B. Kahng
DCC
2001
IEEE
14 years 10 months ago
A Posteriori Quantized Matching Pursuit
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit pr...
Pascal Frossard, Pierre Vandergheynst
CVPR
2010
IEEE
14 years 6 months ago
Parallel Graph-cuts by Adaptive Bottom-up Merging
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
Jiangyu Liu, Jian Sun