Sciweavers

2623 search results - page 440 / 525
» Universal Learning Theory
Sort
View
128
Voted
COLT
2008
Springer
15 years 2 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
107
Voted
DC
2007
15 years 17 days ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
IACR
2011
196views more  IACR 2011»
14 years 7 days ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
SIGCSE
2012
ACM
284views Education» more  SIGCSE 2012»
13 years 8 months ago
Teaching operating systems using android
The computing landscape is shifting towards mobile devices. To learn about operating systems, it is increasingly important for students to gain hands-on kernel programming experie...
Jeremy Andrus, Jason Nieh
120
Voted
WWW
2009
ACM
16 years 1 months ago
Adaptive bidding for display advertising
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...
Arpita Ghosh, Benjamin I. P. Rubinstein, Sergei Va...