19003 search results - page 412 / 3801 » We Need Assurance! |
191
click to vote
TOC
2010
15 years 2 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
224
click to vote
ICANN
2011
Springer
14 years 11 months ago
2011
Springer
This paper is concerned with estimation of learning curves for Gaussian process regression with multidimensional numerical integration. We propose an approach where the recursion e...
189
click to vote
PLDI
2012
ACM
13 years 10 months ago
2012
ACM
Efficient communication and synchronization is crucial for finegrained parallelism. Libraries providing such features, while indispensable, are difficult to write, and often ca...
186
click to vote
IJSNET
2008
15 years 7 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
254
click to vote
CHI
2002
ACM
16 years 8 months ago
2002
ACM
The Special Interest Group on Computer Human Interaction (SIGCHI) has had a successful history of 20 years of growth in its numbers and influence. To help guide the continued evol...