Sciweavers

9 search results - page 2 / 2
» Growth of the Ideal Generated by a Quadratic Boolean Functio...
Sort
View
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
14 years 2 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
CGO
2003
IEEE
14 years 4 months ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz
GECCO
2004
Springer
14 years 4 months ago
A Step Size Preserving Directed Mutation Operator
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
Stefan Berlik
CVPR
2010
IEEE
14 years 4 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan