10054 search results - page 235 / 2011 » On the Complexity of Function Learning |
DAGSTUHL
2006
15 years 2 months ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
113
click to vote
CE
2008
15 years 1 months ago
2008
The portability and immediate communication properties of mobile devices influence the learning processes in interacting with peers, accessing resources and transferring data. For...
112
click to vote
TREC
2004
15 years 2 months ago
2004
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...
113
click to vote
ACMICEC
2003
ACM
15 years 6 months ago
2003
ACM
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
116
click to vote
EUROCRYPT
2010
Springer
15 years 6 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...