Results 1  10
of
476
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
likelihood weighting 3.1 The PYRAMID network All nodes were binary and the conditional probabilities were represented by tablesentries in the conditional probability tables (CPTs) were chosen uniformly in the range (0, 1]. 3.2 The toyQMR network All nodes were binary and the conditional probabilities
Secure Execution Via Program Shepherding
, 2002
"... We introduce program shepherding, a method for monitoring control flow transfers during program execution to enforce a security policy. Program shepherding provides three techniques as building blocks for security policies. First, shepherding can restrict execution privileges on the basis of code or ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
code except through declared entry points, and can ensure that a return instruction only targets the instruction after a call. Finally, shepherding guarantees that sandboxing checks placed around any type of program operation will never be bypassed. We have implemented these capabilities efficiently
Scalable High Speed IP Routing Lookups
, 1997
"... Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP routing lookup requires computing the best matching prefix, for which standard solutions like hashing were believed to be ..."
Abstract

Cited by 202 (13 self)
 Add to MetaCart
increase: independent of the table size, it requires a worst case time of log 2 (address bits) hash lookups. Thus only 5 hash lookups are needed for IPv4 and 7 for IPv6. We also introduce Mutating Binary Search and other optimizations that, for a typical IPv4 backbone router with over 33,000 entries
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
"... We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to consider the associated integer polytopes. Several important and wellknown integer polytopes — the cut, boolean quadric, ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to consider the associated integer polytopes. Several important and wellknown integer polytopes — the cut, boolean quadric
Binary Strings
 Handbook of Evolutionary Computation, chapter C 1.2. IOP Publishing Ltd and
, 1997
"... Binary vectors of fixed length, the standard representation of solutions within canonical genetic algorithms, are discussed in this section, with some emphasis on the question of whether this representation should also be used for problems where the search space fundamentally differs from the space ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, which can be represented by binary vectors simply G9.6, G9.7 by including (excluding) a vertex, set, or item i in (from) a candidate solution when the corresponding entry ai = 1(ai=0). Canonical genetic algorithms, however, also emphasize the binary representation in the case of problems f: S → R where
Significance and recovery of block structures in binary matrices with noise
 Department of Statistics and Operation Research, UNC Chapel
, 2005
"... Abstract. Frequent itemset mining (FIM) is one of the core problems in the field of Data Mining and occupies a central place in its literature. One equivalent form of FIM can be stated as follows: given a rectangular data matrix with binary entries, find every submatrix of 1s having a minimum number ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Abstract. Frequent itemset mining (FIM) is one of the core problems in the field of Data Mining and occupies a central place in its literature. One equivalent form of FIM can be stated as follows: given a rectangular data matrix with binary entries, find every submatrix of 1s having a minimum
BCS: Compressive Sensing for Binary Sparse Signals
"... Abstract—Modelbased compressive sensing (CS) for signalspecific applications is of particular interest in the sparse signal approximation. In this paper, we deal with a special class of sparse signals with binary entries. Unlike conventional CS approaches based on l1 minimization, we model the CS p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—Modelbased compressive sensing (CS) for signalspecific applications is of particular interest in the sparse signal approximation. In this paper, we deal with a special class of sparse signals with binary entries. Unlike conventional CS approaches based on l1 minimization, we model the CS
LEARNING BINARY RELATIONS AND TOTAL ORDERS
, 1993
"... The problem of learning a binary relation between two sets of objects or between a set and itself is studied. This paper represents a binary relation between a set of size n and a set of size rn as an n rn matrix of bits whose (i, j) entry is if and only if the relation holds between the correspond ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
The problem of learning a binary relation between two sets of objects or between a set and itself is studied. This paper represents a binary relation between a set of size n and a set of size rn as an n rn matrix of bits whose (i, j) entry is if and only if the relation holds between
BINARY RANKS AND BINARY FACTORIZATIONS OF NONNEGATIVE INTEGER MATRICES ∗
"... Abstract. A matrix is binary if each of its entries is either 0 or 1. The binary rank of a nonnegative integer matrix A is the smallest integer b such that A = BC, where B and C are binary matrices, and B has b columns. In this paper, bounds for the binary rank are given, and nonnegative integer mat ..."
Abstract
 Add to MetaCart
Abstract. A matrix is binary if each of its entries is either 0 or 1. The binary rank of a nonnegative integer matrix A is the smallest integer b such that A = BC, where B and C are binary matrices, and B has b columns. In this paper, bounds for the binary rank are given, and nonnegative integer
Banded structure in binary matrices
 In KDD ’08: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
, 2008
"... A 0–1 matrix has a banded structure if both rows and columns can be permuted so that the nonzero entries exhibit a staircase pattern of overlapping rows. The concept of banded matrices has its origins in numerical analysis, where entries can be viewed as descriptions between the problem variables; ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
A 0–1 matrix has a banded structure if both rows and columns can be permuted so that the nonzero entries exhibit a staircase pattern of overlapping rows. The concept of banded matrices has its origins in numerical analysis, where entries can be viewed as descriptions between the problem variables
Results 1  10
of
476