Sciweavers

1640 search results - page 71 / 328
» Conditional Independence Trees
Sort
View
148
Voted
AAECC
2009
Springer
150views Algorithms» more  AAECC 2009»
15 years 9 months ago
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...
Víctor Álvarez, José Á...
110
Voted
JMLR
2010
146views more  JMLR 2010»
14 years 9 months ago
Nonparametric Tree Graphical Models
We introduce a nonparametric representation for graphical model on trees which expresses marginals as Hilbert space embeddings and conditionals as embedding operators. This formul...
Le Song, Arthur Gretton, Carlos Guestrin
LICS
2007
IEEE
15 years 9 months ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen
116
Voted
ACL
2008
15 years 4 months ago
Computing Confidence Scores for All Sub Parse Trees
Computing confidence scores for applications, such as dialogue system, information retrieving and extraction, is an active research area. However, its focus has been primarily on ...
Feng Lin, Fuliang Weng
INDOCRYPT
2001
Springer
15 years 7 months ago
Mobile Agent Route Protection through Hash-Based Mechanisms
Abstract. One approach to secure mobile agent execution is restricting the agent route to trusted environments. A necessary condition for this approach to be practical is that the ...
Josep Domingo-Ferrer