Sciweavers

2693 search results - page 70 / 539
» On Computing Complex Navigation Functions
Sort
View
ICIP
2003
IEEE
14 years 11 months ago
PDE-based denoising of complex scenes using a spatially-varying fidelity term
The widely used denoising algorithms based on nonlinear diffusion, such as Perona-Malik and total variation denoising, modify images toward piecewise constant functions. Though ed...
Guy Gilboa, Yehoshua Y. Zeevi, Nir A. Sochen
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 10 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
NAR
2011
252views Computer Vision» more  NAR 2011»
13 years 24 days ago
BISC: Binary SubComplexes in proteins database
Binary subcomplexes in proteins database (BISC) is a new protein–protein interaction (PPI) database linking up the two communities most active in their characterization: structu...
Thomas Juettemann, Dietlind L. Gerloff
IACR
2011
94views more  IACR 2011»
12 years 9 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
13 years 1 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou