921 search results - page 161 / 185 » Expressing Computational Complexity in Constructive Type The... |
COCO
1994
Springer
14 years 8 days ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
BMCBI
2006
13 years 8 months ago
2006
Background: Gene function analysis often requires a complex and laborious sequence of laboratory and computer-based experiments. Choosing an effective experimental design generall...