Sciweavers

152 search results - page 22 / 31
» Robust Polynomials and Quantum Algorithms
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 8 months ago
Evolution with Drifting Targets
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...
ICPR
2000
IEEE
14 years 26 days ago
Boundary Estimation from Intensity/Color Images with Algebraic Curve Models
A new concept and algorithm are presented for noniterative robust estimation of piecewise smooth curves of maximal edge strength in small image windows – typically  ¢¡£  to...
Tolga Tasdizen, David B. Cooper
COLOGNETWENTE
2007
13 years 10 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia
ICIP
2008
IEEE
14 years 2 months ago
Hardware-friendly descreening
Conventional electrophotographic printers tend to produce Moir´e artifacts when used for printing images scanned from printed material such as books and magazines. We propose a n...
Hasib Siddiqui, Mireille Boutin, Charles A. Bouman