229 search results - page 41 / 46 » Proving Bounds on Real-Valued Functions with Computations |
IM
2006
14 years 10 months ago
2006
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
115
click to vote
PODC
2006
ACM
15 years 4 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
STACS
2010
Springer
15 years 5 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...
MOBIHOC
2010
ACM
14 years 8 months ago
2010
ACM
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...