Sciweavers

589 search results - page 14 / 118
» Generalized Dominators and Post-Dominators
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ASAP
2002
IEEE
105views Hardware» more  ASAP 2002»
14 years 11 days ago
Implications of Programmable General Purpose Processors for Compression/Encryption Applications
With the growth of the Internet and mobile communication industry, multimedia applications form a dominant computer workload. Media workloads are typically executed on Application...
Byeong Kil Lee, Lizy Kurian John
TIT
2010
81views Education» more  TIT 2010»
13 years 2 months ago
Generalizing capacity: new definitions and capacity theorems for composite channels
We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with...
Michelle Effros, Andrea J. Goldsmith, Yifan Liang
JAIR
2008
123views more  JAIR 2008»
13 years 7 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
EUSFLAT
2007
185views Fuzzy Logic» more  EUSFLAT 2007»
13 years 8 months ago
Dominance of Ordinal Sums of TL and TP
Dominance is a relation on operations which are defined on a common poset. We treat the dominance relation on the set of ordinal sum t-norms which involve either exclusively the ...
Susanne Saminger, Peter Sarkoci