Sciweavers

228 search results - page 18 / 46
» Relational queries over interpreted structures
Sort
View
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
15 years 11 months ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
FROCOS
2000
Springer
15 years 9 months ago
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Paqui Lucio
MM
2004
ACM
151views Multimedia» more  MM 2004»
15 years 11 months ago
Affinity relation discovery in image database clustering and content-based retrieval
In this paper, we propose a unified framework, called Markov Model Mediator (MMM), to facilitate image database clustering and to improve the query performance. The structure of t...
Mei-Ling Shyu, Shu-Ching Chen, Min Chen, Chengcui ...
EDBT
2006
ACM
124views Database» more  EDBT 2006»
16 years 6 months ago
Supporting Temporal Slicing in XML Databases
Nowadays XML is universally accepted as the standard for structural data representation; XML databases, providing structural querying support, are thus becoming more and more popul...
Federica Mandreoli, Riccardo Martoglia, Enrico Ron...
CP
2010
Springer
15 years 4 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard