Sciweavers

4066 search results - page 69 / 814
» Almost Complete Sets
Sort
View
AAAI
2012
12 years 13 days ago
Transportability of Causal Effects: Completeness Results
The study of transportability aims to identify conditions under which causal information learned from experiments can be reused in a different environment where only passive obser...
Elias Bareinboim, Judea Pearl
ATAL
2007
Springer
14 years 4 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
MCSS
2007
Springer
13 years 10 months ago
A complete model of a finite-dimensional impedance-passive system
We extend the classes of standard discrete- and continuous-time input/state/ output matrix systems by adding reverse internal and/or external channels. The reverse internal channe...
Mikael Kurula, Olof J. Staffans
TASLP
2010
138views more  TASLP 2010»
13 years 4 months ago
Glimpsing IVA: A Framework for Overcomplete/Complete/Undercomplete Convolutive Source Separation
Abstract--Independent vector analysis (IVA) is a method for separating convolutedly mixed signals that significantly reduces the occurrence of the well-known permutation problem in...
Alireza Masnadi-Shirazi, Wenyi Zhang, Bhaskar D. R...
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
14 years 3 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...