176 search results - page 30 / 36 » On the analysis of queries with counting constraints |
289
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
180
Voted
ACSC
2004
IEEE
15 years 9 months ago
2004
IEEE
Given the rate of growth of the Web, scalability of search engines is a key issue, as the amount of hardware and network resources needed is large, and expensive. In addition, sea...
164
click to vote
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Policies are declarations of constraints on the behaviour of components within distributed systems, and are often used to capture norms within agent-based systems. A few ...
153
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
165
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...