1679 search results - page 78 / 336 » Pointcuts as Functional Queries |
SIAMCOMP
2010
14 years 7 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...
80
Voted
AAAI
2008
15 years 3 months ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
103
Voted
COCO
2008
Springer
15 years 2 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
110
Voted
BMCBI
2010
15 years 28 days ago
2010
Background: The increasing number of sequenced genomes provides the basis for exploring the genetic and functional diversity within the tree of life. Only a tiny fraction of the e...
118
Voted
TREC
2003
15 years 2 months ago
2003
Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on...