Sciweavers

1418 search results - page 244 / 284
» Schema polynomials and applications
Sort
View
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
14 years 13 days ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
14 years 13 days ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
14 years 11 days ago
Multi-objective optimization tool for a free structure analog circuits design using genetic algorithms and incorporating parasit
This paper presents a novel approach for a free structure analog circuit design using Genetic Algorithms (GA). A major problem in a free structure circuit is its sensitivity calcu...
Yaser M. A. Khalifa, Badar K. Khan, Faisal Taha
ICCV
2007
IEEE
14 years 11 days ago
Efficient Generic Calibration Method for General Cameras with Single Centre of Projection
Generic camera calibration is a non-parametric calibration technique that is applicable to any type of vision sensor. However, the standard generic calibration method was develope...
Aubrey K. Dunne, John Mallon, Paul F. Whelan
ATAL
2006
Springer
14 years 7 days ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein