465 search results - page 78 / 93 » On the Hardness of Range Assignment Problems |
126
click to vote
SIGSOFT
2006
ACM
16 years 2 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
WWW
2008
ACM
16 years 2 months ago
2008
ACM
Information Retrieval on the WWW is important because it is hard to find what one is looking for. There is a plethora of information available, and searching relevant information ...
226
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
122
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
153
click to vote
IPSN
2007
Springer
15 years 8 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...