4940 search results - page 577 / 988 » On the Complexity of Universal Programs |
176
click to vote
DIS
2004
Springer
16 years 5 days ago
2004
Springer
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
190
click to vote
VL
2003
IEEE
16 years 1 days ago
2003
IEEE
Web services are increasingly attracting attention for their ability to provide standard interfaces to heterogeneous distributed services. Through these standard interfaces, it is...
184
click to vote
COCOON
2003
Springer
16 years 11 hour ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
169
click to vote
GCC
2003
Springer
16 years 2 hour ago
2003
Springer
Even though grid research is prosperous in an extensive context, few grid platforms for high performance computing are practical and in operation so far. Since most applications a...
193
click to vote
ASP
2001
Springer
15 years 11 months ago
2001
Springer
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...