Sciweavers

1451 search results - page 33 / 291
» Order independence and rationalizability
Sort
View
COMBINATORICS
2004
129views more  COMBINATORICS 2004»
13 years 8 months ago
Operations on Well-Covered Graphs and the Roller-Coaster Conjecture
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
Philip Matchett
ICC
2007
IEEE
123views Communications» more  ICC 2007»
14 years 2 months ago
The Effect of Ordered Detection and Antenna Selection on Diversity Gain of Decision Feedback Detector
— The decision feedback detector (DFD) can achieve the high spectral efficiency of a MIMO channel in that it converts the MIMO channel into multiple parallel layers, through whi...
Yi Jiang, Mahesh K. Varanasi
JCT
2011
67views more  JCT 2011»
13 years 3 months ago
Inversion arrangements and Bruhat intervals
Let W be a finite reflection group. For a given w ∈ W, the following assertion may or may not be satisfied: (∗) The principal Bruhat order ideal of w contains as many elemen...
Axel Hultman
JMLR
2011
145views more  JMLR 2011»
13 years 3 months ago
Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Func
We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks...
Jim C. Huang, Brendan J. Frey
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
14 years 9 months ago
Ordering patterns by combining opinions from multiple sources
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...
Pang-Ning Tan, Rong Jin