1650 search results - page 208 / 330 » The HOM problem is decidable |
136
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
142
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
We perform a theoretical study of the following queryview security problem: given a view V to be published, does V logically disclose information about a confidential query S? The...
139
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
125
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Recently proposed form-based web information systems liberate the capture and reuse of data in organizations by substituting the development of technical implementations of electr...
135
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...