Sciweavers

495 search results - page 58 / 99
» Probability Trees
Sort
View
CPC
1998
154views more  CPC 1998»
13 years 8 months ago
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
Brendan D. McKay, Robert W. Robinson
TON
1998
80views more  TON 1998»
13 years 8 months ago
Blocking and nonblocking multirate Clos switching networks
— This paper investigates in detail the blocking and nonblocking behavior of multirate Clos switching networks at the connection/virtual connection level. The results are applica...
Soung C. Liew, Ming-Hung Ng, Cathy W. Chan
FOCS
2005
IEEE
14 years 2 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
JMLR
2010
117views more  JMLR 2010»
13 years 3 months ago
Exploiting the High Predictive Power of Multi-class Subgroups
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
Tarek Abudawood, Peter A. Flach
ACL
2009
13 years 6 months ago
Variational Decoding for Statistical Machine Translation
Statistical models in machine translation exhibit spurious ambiguity. That is, the probability of an output string is split among many distinct derivations (e.g., trees or segment...
Zhifei Li, Jason Eisner, Sanjeev Khudanpur