Sciweavers

248 search results - page 18 / 50
» The Relative Complexity of NP Search Problems
Sort
View
EDBT
2006
ACM
137views Database» more  EDBT 2006»
14 years 7 months ago
Data Mapping as Search
In this paper, we describe and situate the TUPELO system for data mapping in relational databases. Automating the discovery of mappings between structured data sources is a long st...
George H. L. Fletcher, Catharine M. Wyss
CSL
2003
Springer
14 years 28 days ago
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
Thomas Eiter, Kazuhisa Makino
ICASSP
2011
IEEE
12 years 11 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
SIGIR
2010
ACM
13 years 11 months ago
Entity information management in complex networks
Entity information management (EIM) is a nascent IR research area that investigates the information management process about entities instead of documents. It is motivated by the ...
Yi Fang
ICDE
2009
IEEE
184views Database» more  ICDE 2009»
14 years 2 months ago
Scalable Keyword Search on Large Data Streams
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao