2517 search results - page 285 / 504 » Specifying Weak Sets |
213
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
165
click to vote
ACL
1997
15 years 8 months ago
1997
A new account of parameter setting during grammatical acquisition is presented in terms of Generalized Categorial Grammar embedded in a default inheritance hierarchy, providing a ...
273
click to vote
SSD
2009
Springer
16 years 1 months ago
2009
Springer
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
177
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
199
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...