347 search results - page 44 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
105
click to vote
CCS
2008
ACM
15 years 1 months ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
108
click to vote
BMCBI
2007
14 years 11 months ago
2007
Several systems have been presented in the last years in order to manage the complexity of large microarray experiments. Although good results have been achieved, most systems ten...
CC
2008
Springer
14 years 12 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
101
click to vote
ICDCSW
2009
IEEE
15 years 6 months ago
2009
IEEE
Broadcast of information in wireless sensor networks is an important operation, e.g., for code updates, queries, membership information, etc. In this paper, we analyze and experim...
103
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Two-player games of billiards, of the sort seen in recent Computer Olympiads held by the International Computer Games Association, are an emerging area with unique challenges for ...