1631 search results - page 133 / 327 » Uniform Distributed Synthesis |
135
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
120
Voted
DCC
2004
IEEE
16 years 2 months ago
2004
IEEE
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
113
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...
112
Voted
GRID
2007
Springer
15 years 8 months ago
2007
Springer
Abstract— Metadata annotations of Grid resources can potentially be used for a number of purposes, including accurate resource allocation to jobs, discovery of services, and prec...
102
click to vote
ISM
2006
IEEE
15 years 8 months ago
2006
IEEE
Currently, most quantization based data hiding algorithms are built assuming specific distributions of attacks, such as additive white Gaussian noise (AWGN), uniform noise, and s...