Sciweavers

5699 search results - page 283 / 1140
» Alternating model trees
Sort
View
AI
2008
Springer
15 years 7 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson
JCB
1998
105views more  JCB 1998»
15 years 7 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 5 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
CLUSTER
2007
IEEE
16 years 1 months ago
Network performance model for TCP/IP based cluster computing
— A new communication model, called the PlogPT model, is proposed to predict communication performance in a commodity cluster where computing nodes communicate using TCP/IP. This...
Akihiro Nomura, Hiroya Matsuba, Yutaka Ishikawa
EMNLP
2006
15 years 8 months ago
Extremely Lexicalized Models for Accurate and Fast HPSG Parsing
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...
Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsur...