983 search results - page 75 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
SIAMCOMP
2010
13 years 5 months ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
COCO
2008
Springer
14 years 3 days ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
INFORMATICASI
1998
13 years 10 months ago
1998
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
ICCV
2003
IEEE
15 years 6 days ago
2003
IEEE
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...