Sciweavers

10435 search results - page 1937 / 2087
» Computational Biology and Language
Sort
View
LICS
1997
IEEE
15 years 10 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
SP
1997
IEEE
126views Security Privacy» more  SP 1997»
15 years 10 months ago
Filtering Postures: Local Enforcement for Global Policies
When packet filtering is used as a security mechanism, different routers may need to cooperate to enforce the desired security policy. It is difficult to ensure that they will d...
Joshua D. Guttman
ATAL
1997
Springer
15 years 10 months ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche
ICDT
1997
ACM
95views Database» more  ICDT 1997»
15 years 10 months ago
Type-Consistency Problems for Queries in Object-Oriented Databases
Abstract Method invocation mechanism is one of the essential features in objectoriented programming languages. This mechanism contributes to data encapsulation and code reuse, but ...
Yasunori Ishihara, Hiroyuki Seki, Minoru Ito
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 10 months ago
Query Execution Techniques for Caching Expensive Methods
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
Joseph M. Hellerstein, Jeffrey F. Naughton
« Prev « First page 1937 / 2087 Last » Next »