1451 search results - page 45 / 291 » Order independence and rationalizability |
169
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
145
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
138
click to vote
ICA
2007
Springer
16 years 17 days ago
2007
Springer
We consider Independent Component Analysis (ICA) for the case of binary sources, where addition has the meaning of the boolean “Exclusive Or” (XOR) operation. Thus, each mixtur...
159
click to vote
FLAIRS
2004
15 years 7 months ago
2004
How to compute marginals efficiently is one of major concerned problems in probabilistic reasoning systems. Traditional graphical models do not preserve all conditional independen...
183
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...