Results 1  10
of
402,351
Analysis of Bit Operations and Proposal for The Hash Functions
, 2005
"... Abstract This paper provide three axioms of bit operations for nbit word, and point out the weakness of the popular hash functions. The proposal is helpful for improving the security of the hash functions. ..."
Abstract
 Add to MetaCart
Abstract This paper provide three axioms of bit operations for nbit word, and point out the weakness of the popular hash functions. The proposal is helpful for improving the security of the hash functions.
Factoring polynomials with rational coefficients
 MATH. ANN
, 1982
"... In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract

Cited by 961 (11 self)
 Add to MetaCart
polynomials feZ[X] into irreducible factors in Z[X]. Here we call f ~ Z[X] primitive if the greatest common divisor of its coefficients (the content of f) is 1. Our algorithm performs well in practice, cf. [8]. Its running time, measured in bit operations, is O(nl2+n9(log[fD3). Here f~Tl[X] is the polynomial
A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
 COMBINATORICA
, 1984
"... We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract

Cited by 860 (3 self)
 Add to MetaCart
We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than
Tree visualization with Treemaps: A 2d spacefilling approach
 ACM Transactions on Graphics
, 1991
"... this paper deals with a twodimensional (2d) spacefilling approach in which each node is a rectangle whose area is proportional to some attribute such as node size. Research on relationships between 2d images and their representation in tree structures has focussed on node and link representation ..."
Abstract

Cited by 534 (29 self)
 Add to MetaCart
representations of 2d images. This work includes quadtrees (Samet, 1989) and their variants which are important in image processing. The goal of quad trees is to provide a tree representation for storage compression and efficient operations on bitmapped images. XYtrees (Nagy & Seth, 1984) are a
Approximate String Matching Based on Bit Operations∗
"... The bitparallelism is a speedup method for solving problems of string matching. The speedup by the bitparallelism depends on the performance of a computer and it is very significant in practice. In terms of time complexity based on a standard computational model, however, the performance cannot be ..."
Abstract
 Add to MetaCart
The bitparallelism is a speedup method for solving problems of string matching. The speedup by the bitparallelism depends on the performance of a computer and it is very significant in practice. In terms of time complexity based on a standard computational model, however, the performance cannot
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
functions must distribute over the confluence operator (either union or intersection). This class of problems includes—but is not limited to—the classical separable problems (also known as “gen/kill ” or “bitvector” problems)—e.g., reaching definitions, available expressions, and live variables
Probabilistic Counting Algorithms for Data Base Applications
, 1985
"... This paper introduces a class of probabilistic counting lgorithms with which one can estimate the number of distinct elements in a large collection of data (typically a large file stored on disk) in a single pass using only a small additional storage (typically less than a hundred binary words) a ..."
Abstract

Cited by 444 (6 self)
 Add to MetaCart
) and only a few operations per element scanned. The algorithms are based on statistical observations made on bits of hashed values of records. They are by con struction totally insensitive to the replicafive structure of elements in the file; they can be used in the context of distributed systems
A New Interval Approximation Supporting Bit Operations and Byte Access
, 2006
"... In this paper we present a new variant of the commonly used interval approximation based on the socalled valid interval approach. This new approach supports arithmetic and bit operations including shift and rotate functions. Furthermore, it allows read and write access to the byte representation of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we present a new variant of the commonly used interval approximation based on the socalled valid interval approach. This new approach supports arithmetic and bit operations including shift and rotate functions. Furthermore, it allows read and write access to the byte representation
Error Control and Concealment for Video Communication  A Review
 PROCEEDINGS OF THE IEEE
, 1998
"... The problem of error control and concealment in video communication is becoming increasingly important because of the growing interest in video delivery over unreliable channels such as wireless networks and the Internet. This paper reviews the techniques that have been developed for error control a ..."
Abstract

Cited by 438 (13 self)
 Add to MetaCart
and concealment in the past ten to fifteen years. These techniques are described in three categories according to the roles that the encoder and decoder play in the underlying approaches. Forward error concealment includes methods that add redundancy at the source end to enhance error resilience of the coded bit
Lightweight Shared Objects in a 64Bit Operating System
 ACM ObjectOriented Programming Systems, Languages, and Applications (OOPSLA
, 1992
"... Objectoriented models are a popular basis for supporting uniform sharing of data and services in operating systems, distributed programming systems, and database systems. We term systems that use objects for these purposes object sharing systems. Operating systems in common use have nonuniform add ..."
Abstract

Cited by 38 (5 self)
 Add to MetaCart
systems. We describe facilities for objectbased sharing of persistent data and services in Opal, an operating system we are developing for paged 64bit architectures. The distinctive feature of Opal is that object This paper will appear in identical form in the proceedings of the Conference on Object
Results 1  10
of
402,351