Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
284,128
Memory-Efficient Data Structures for . . .
"... : Generating imperative programs from systolic specifications implies the use of a memory-efficient model for representing data used in the original, single-assignment problem. We present a new method of generating data structures, designed for use in systolic program compilers for distributed-memor ..."
Abstract
- Add to MetaCart
: Generating imperative programs from systolic specifications implies the use of a memory-efficient model for representing data used in the original, single-assignment problem. We present a new method of generating data structures, designed for use in systolic program compilers for distributed
efficient Data Structures
"... We consider the problem of preprocessing an array A[1..n] to answer range selection and range top-k queries. Given a query interval [i..j] and a value k, the former query asks for the position of the kth largest value in A[i..j], whereas the latter asks for the positions of all the k largest values ..."
Abstract
- Add to MetaCart
in A[i..j]. We consider the encoding version of the problem, where A is not available at query time, and an upper bound κ on k, the rank that is to be selected, is given at construction time. We obtain data structures with asymptotically optimal size and query time on a RAM model with word size Θ
Efficient Data Structures for Fast SAT Solvers
, 2001
"... The implementation of efficient Boolean Satis ability (SAT) solvers entails the utilization of highly efficient data structures, as illustrated by most of the recent state-of-the-art SAT solvers. ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
The implementation of efficient Boolean Satis ability (SAT) solvers entails the utilization of highly efficient data structures, as illustrated by most of the recent state-of-the-art SAT solvers.
Efficient Data Structures for Backtrack Search SAT Solvers
, 2002
"... The implementation of efficient Propositional Satisfiability (SAT) solvers entails the utilization of highly efficient data structures, as illustrated by most of the recent state-of-the-art SAT solvers. However, it is in general hard to compare existing data structures, since different solvers are o ..."
Abstract
-
Cited by 24 (3 self)
- Add to MetaCart
The implementation of efficient Propositional Satisfiability (SAT) solvers entails the utilization of highly efficient data structures, as illustrated by most of the recent state-of-the-art SAT solvers. However, it is in general hard to compare existing data structures, since different solvers
Efficient Data Structures for Storing the Partitions of Integers
"... Algorithms for enumerating the partitions of a positive integer n have long been invented. However, data structure for storing the partitions is not received due attention. In this paper, several data structures, ranging from the most intuitive one to the most efficient one, are proposed. The space ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Algorithms for enumerating the partitions of a positive integer n have long been invented. However, data structure for storing the partitions is not received due attention. In this paper, several data structures, ranging from the most intuitive one to the most efficient one, are proposed. The space
Efficient Data Structures for Range Searching on a Grid
, 1987
"... We consider the 2-dimensional range searching problem in the case where all point lie on an integer grid. A new data structure is preented that solves range queries on a U U grid in O(k + loglog U) time using O(n log n) storage, where n is the number of points and k the number of reported answers ..."
Abstract
-
Cited by 42 (0 self)
- Add to MetaCart
We consider the 2-dimensional range searching problem in the case where all point lie on an integer grid. A new data structure is preented that solves range queries on a U U grid in O(k + loglog U) time using O(n log n) storage, where n is the number of points and k the number of reported
Efficient Data Structures in a Lazy Functional Language
, 2003
"... Although a lot of theoretical work has been done on purely functional data structures, few of them have actually been implemented to general usefulness, let alone as part of a data structure library providing a uniform framework.
In 1998, Chris Okasaki started to change this by implementing Edison, ..."
Abstract
- Add to MetaCart
, a library of efficient data structures for Haskell.
Unfortunately, he abandoned his work after creating a framework and writing some data structure implementations for parts of it.
This document first gives an overview of the current state of Edison and describes what efficiency in a lazy language
An Efficient Data Structure for Network Anomaly Detection
"... Abstract — Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two major technologies need to be addressed. The first one is efficient feature-extraction algorithms/hardware that can mat ..."
Abstract
- Add to MetaCart
match a line rate in the order of Gb/s; the second one is fast and effective anomaly detection schemes. In this paper, we focus on design of efficient data structure and algorithms for feature extraction. Specifically, we propose a novel data structure that extracts socalled two-directional (2D
Results 1 - 10
of
284,128
