Results 1  10
of
1,063
Locally Updatable and Locally Decodable Codes
, 2013
"... We introduce the notion of locally updatable and locally decodable codes (LULDCs). While, intuitively, updatability and errorcorrection seem to be contrasting goals, we show that for a suitable, yet meaningful, metric (which we call the Prefix Hamming metric), one can construct such codes. Informal ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
of the codeword). We first construct binary LULDCs for messages in {0, 1} k with constant rate, update locality of O(log 2 k), and read locality of O(k ɛ) for any constant ɛ < 1. Next, we consider the case where the encoder and decoder share a secret state and the adversary is computationally bounded. Here too
The Z_4linearity of Kerdock, Preparata, Goethals, and related codes
, 2001
"... Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by NordstromRobinson, Kerdock, Preparata, Goethals, and DelsarteGoethals. It is shown here that all these codes can be very simply constructed as binary images under the ..."
Abstract

Cited by 178 (15 self)
 Add to MetaCart
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by NordstromRobinson, Kerdock, Preparata, Goethals, and DelsarteGoethals. It is shown here that all these codes can be very simply constructed as binary images under
A novel method of protein secondary structure prediction with high segment overlap measure: support vector machine approach
 J MOL BIOL
, 2001
"... We have introduced a new method of protein secondary structure prediction which is based on the theory of support vector machine (SVM). SVM represents a new approach to supervised pattern classification which has been successfully applied to a wide range of pattern recognition problems, including ob ..."
Abstract

Cited by 177 (3 self)
 Add to MetaCart
to predict protein secondary structure is described here. Unlike the previous studies, we first constructed several binary classifiers, then assembled a tertiary classifier for three secondary structure states (helix, sheet and coil) based on these binary classifiers. The SVM method achieved a good
Efficient Binary Space Partitions for HiddenSurface Removal and Solid Modeling
, 1990
"... We consider schemes for recursively dividing a set of geometric objects by hyperplanes until all objects are separated. Such a binary space partition, or BSP, is naturally considered as a binary tree where each internal node corresponds to a division. The goal is to choose the hyperplanes properly ..."
Abstract

Cited by 103 (0 self)
 Add to MetaCart
applications of efficient BSPs are given. The first is an O(n²)sized data structure for implementing a hiddensurface removal scheme of Fuchs et al. [6]. The second application is in solid modeling: given a polyhedron described by its n faces, we show how to generate an O(n²)sized CSG (constructive
The Coign Automatic Distributed Partitioning System
, 1999
"... Although successive generations of middleware (such as RPC, CORBA, and DCOM) have made it easier to connect distributed programs, the process of distributed application decomposition has changed little: programmers manually divide applications into subprograms and manually assign those subprograms ..."
Abstract

Cited by 154 (9 self)
 Add to MetaCart
present Coign, an automatic distributed partitioning system that significantly eases the development of distributed applications. Given an application (in binary form) built from distributable COM components, Coign constructs a graph model of the application’s intercomponent communication through
On Binary Constraint Networks
, 1988
"... It is wellknown that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain of intere ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
It is wellknown that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain
NEW BINARY
"... Communicated by R. Hill Abstract. New extremal binary selfdual codes of lengths 50 and 52 are constructed. Some of them are the first known codes with such weight enumerators. The structure of their automorphisms groups are shown. ..."
Abstract
 Add to MetaCart
Communicated by R. Hill Abstract. New extremal binary selfdual codes of lengths 50 and 52 are constructed. Some of them are the first known codes with such weight enumerators. The structure of their automorphisms groups are shown.
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
this period. 5 As the example in the Appendix illustrates, this method of coding ties produces a binary adjacency matrix. It is possible to construct a valued adjacency matrix accounting not only for the existence of a tie between two VCs but also for the number of times there is a tie between them. While
Constructions of binary constantweight cyclic codes and cyclically permutable codes
 IEEE Trans. Inform. Theory
, 1992
"... AbstractA general theorem is proved showing how to ohtain a constantweight binary cyclic code from a pary linear cyclic code, where p is a prime,. by using a representation of Cl;(p) as cyclic shifts of a binary ptuple. Based on this theorem, constructions are given for four classes of binary co ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
correspondingly optimum classes of constantweight cyclically permutable codes are constructed by appropriate selection of codewords from the first two classes of binary constantweight codes. It is shown that cyclically permutable codes provide a natural solution to the problem of constructing protocol
Parallel BreadthFirst BDD Construction
 In Ninth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
, 1997
"... With the increasing complexity of protocol and circuit designs, formal verification has become an important research area and binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. This paper presents a parallel algorithm for BDD construction targeted at shared ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
With the increasing complexity of protocol and circuit designs, formal verification has become an important research area and binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. This paper presents a parallel algorithm for BDD construction targeted
Results 1  10
of
1,063