2519 search results - page 337 / 504 » Reasoning with Textual Cases |
219
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
198
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
193
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
162
click to vote
EMSOFT
2007
Springer
16 years 20 days ago
2007
Springer
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
151
click to vote
POLICY
2007
Springer
16 years 19 days ago
2007
Springer
The implementation of network security devices such as firewalls and IDSs are constantly being improved to accommodate higher security and performance standards. Using reliable a...