Sciweavers

1813 search results - page 146 / 363
» Instance Pruning Techniques
Sort
View
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
15 years 10 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
DLOG
2003
15 years 7 months ago
Incremental Query Answering for Implementing Document Retrieval Services
Agent systems that search the Semantic Web are seen as killer applications for description logic (DL) inference engines. The guiding examples for the Semantic Web involve informat...
Volker Haarslev, Ralf Möller
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 6 months ago
On Schema Matching with Opaque Column Names and Data Values
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
Jaewoo Kang, Jeffrey F. Naughton
TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
16 years 1 months ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule
IEE
2008
117views more  IEE 2008»
15 years 6 months ago
Formal verification of systems with an unlimited number of components
1 2 3 In many real component-based systems and patterns of component interaction, there can be identified a stable part (like control component, server, instance handler) and a nu...
Pavlína Vareková, Barbora Zimmerova,...