8512 search results - page 1580 / 1703 » Computing Theory With Relevance |
134
click to vote
MOBIHOC
2005
ACM
16 years 2 months ago
2005
ACM
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
155
click to vote
POPL
2010
ACM
16 years 15 days ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
116
click to vote
POPL
2010
ACM
16 years 15 days ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
123
click to vote
IUI
2010
ACM
15 years 12 months ago
2010
ACM
We present an extension of a computational cognitive model of social tagging and exploratory search called the semantic imitation model. The model assumes a probabilistic represen...
113
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...