Sciweavers

10997 search results - page 18 / 2200
» On the Structure of Complete Sets
Sort
View
COCO
2001
Springer
102views Algorithms» more  COCO 2001»
14 years 2 months ago
Separation of NP-Completeness Notions
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...
Aduri Pavan, Alan L. Selman
FROCOS
2000
Springer
14 years 1 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
ER
1999
Springer
104views Database» more  ER 1999»
14 years 2 months ago
A Taxonomy of Recursive Relationships and Their Structural Validity in ER Modeling
Abstract. In this paper, we present the complete classification of recursive relationships and the criteria that contribute to the structural validity of modeling recursive relatio...
James Dullea, Il-Yeol Song
AAAI
2006
13 years 11 months ago
A Characterization of Interventional Distributions in Semi-Markovian Causal Models
We offer a complete characterization of the set of distributions that could be induced by local interventions on variables governed by a causal Bayesian network of unknown structu...
Jin Tian, Changsung Kang, Judea Pearl
CIKM
2006
Springer
14 years 1 months ago
Mining compressed commodity workflows from massive RFID data sets
Radio Frequency Identification (RFID) technology is fast becoming a prevalent tool in tracking commodities in supply chain management applications. The movement of commodities thr...
Hector Gonzalez, Jiawei Han, Xiaolei Li