12 search results - page 2 / 3 » Topologically Continuous Associative Memory: A Theoretical F... |
115
click to vote
ASIACRYPT
2011
Springer
13 years 11 months ago
2011
Springer
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
EDBT
2011
ACM
14 years 3 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
88
Voted
IANDC
2007
14 years 11 months ago
2007
In this paper we study secure information flow policies in the sense of Meadows [12] and others for aggregated datasets, collectively. We first present a method for combining di...
103
click to vote
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
178
Voted
PODS
2009
ACM
16 years 4 days ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...