921 search results - page 160 / 185 » Expressing Computational Complexity in Constructive Type The... |
141
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
140
click to vote
MOBICOM
2005
ACM
15 years 10 months ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
375
click to vote
ICFP
2009
ACM
16 years 5 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
174
click to vote
IPSN
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
166
click to vote
COMPUTING
2008
15 years 5 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...