Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
983
Convolution Kernels on Discrete Structures
, 1999
"... We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes the fa ..."
Abstract
-
Cited by 506 (0 self)
- Add to MetaCart
We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes
INFERENCE FOR LARGE TREE-STRUCTURED DATA
"... Abstract. We develop a parametric inferential framework for fully observed tree-structured data containing a large number of vertices using the distributional properties of the Continuum Random Tree (CRT) introduced by Aldous [1993]. Under a hypothesis testing context, we develop tests based on two ..."
Abstract
- Add to MetaCart
Abstract. We develop a parametric inferential framework for fully observed tree-structured data containing a large number of vertices using the distributional properties of the Continuum Random Tree (CRT) introduced by Aldous [1993]. Under a hypothesis testing context, we develop tests based on two
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
- In ICDE
, 2002
"... XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relationships are parent-child and ancestor-descendant, and finding all occurrences of these structural relationships in an XML da ..."
Abstract
-
Cited by 279 (27 self)
- Add to MetaCart
database is a core operation for XML query processing. In this paper, we develop two families of structural join algorithms for this task: tree-merge and stack-tree. The tree-merge algorithms are a natural extension of traditional merge joins and the recently proposed multi-predicate merge joins, while
NML Computation Algorithms for Tree-Structured Multinomial Bayesian Networks
, 2007
"... Typical problems in bioinformatics involve large discrete datasets. Therefore, in order to apply statistical methods in such domains, it is important to develop efficient algorithms suitable for discrete data. The minimum description length (MDL) principle is a theoretically well-founded, general fr ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
these algorithms to more complex, tree-structured Bayesian networks.
Tree-structure expectation propagation for LDPC decoding over the BEC
- IEEE Trans. Inf. Theory
, 2013
"... Abstract—We present the tree-structure expectation propa-gation (Tree-EP) algorithm to decode low-density parity-check (LDPC) codes over discrete memoryless channels (DMCs). EP generalizes belief propagation (BP) in two ways. First, it can be used with any exponential family distribution over the cl ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
Abstract—We present the tree-structure expectation propa-gation (Tree-EP) algorithm to decode low-density parity-check (LDPC) codes over discrete memoryless channels (DMCs). EP generalizes belief propagation (BP) in two ways. First, it can be used with any exponential family distribution over
Tree-Structured Composition of Homomorphic Encryption: How to Weaken Underlying Assumptions
, 2014
"... Cryptographic primitives based on innite families of progressively weaker assump-tions have been proposed by Hofheinz{Kiltz and by Shacham (the n-Linear assump-tions) and by Escala et al. (the Matrix Diffie{Hellman assumptions). All of these assumptions are extensions of the decisional Diffie{Hellma ..."
Abstract
- Add to MetaCart
assumptions not originating from the DDH as-sumption. Our assumptions are indexed by rooted trees, and provides a completely different structure compared to the previous extensions of the DDH assumption. Our construction of a HE scheme is generic; based on a tree structure, we recur-sively combine copies
Decision Procedures for Inductive Boolean Functions based on Alternating Automata
- In 12th International Conference on Computer-Aided Veri CAV'00, volume 1855 of LNCS
, 2000
"... We show how alternating automata provide decision procedures for the equality of inductively defined Boolean functions and present applications to reasoning about parameterized families of circuits. We use alternating word automata to formalize families of linearly structured circuits and alternatin ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
and alternating tree automata to formalize families of tree structured circuits. We provide complexity bounds for deciding the equality of function (or circuit) families and show how our decision procedures can be implemented using BDDs. In comparison to previous work, our approach is simpler, has better
Shape quantization and recognition with randomized trees
- NEURAL COMPUTATION
, 1997
"... We explore a new approach to shape recognition based on a virtually infinite family of binary features ("queries") of the image data, designed to accommodate prior information about shape invariance and regularity. Each query corresponds to a spatial arrangement ofseveral local topographic ..."
Abstract
-
Cited by 263 (18 self)
- Add to MetaCart
We explore a new approach to shape recognition based on a virtually infinite family of binary features ("queries") of the image data, designed to accommodate prior information about shape invariance and regularity. Each query corresponds to a spatial arrangement ofseveral local
Hopf-Algebraic Structures of Families of Trees
- J. Algebra
, 1987
"... this paper we describe Hopf algebras which are associated with certain families of trees. These Hopf algebras originally arose in a natural fashion: one of the authors [5] was investigating data structures based on trees, which could be used to e#ciently compute certain di#erential operators. Given ..."
Abstract
-
Cited by 84 (17 self)
- Add to MetaCart
this paper we describe Hopf algebras which are associated with certain families of trees. These Hopf algebras originally arose in a natural fashion: one of the authors [5] was investigating data structures based on trees, which could be used to e#ciently compute certain di#erential operators. Given
Results 1 - 10
of
983
