Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,525
THE OPTIMUM EXECUTION ORDER OF QUERIES IN LINEAR STORAGE
, 1990
"... Consider a file that resides in a linear storage device with one read head. Suppose that several queries on the file must be answered simultaneously with no prespecified order. To satisfy the ith query the head must be located at point I., of the file and traverse the file up to point R, without int ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
Consider a file that resides in a linear storage device with one read head. Suppose that several queries on the file must be answered simultaneously with no prespecified order. To satisfy the ith query the head must be located at point I., of the file and traverse the file up to point R, without
Computational Interpretations of Linear Logic
- Theoretical Computer Science
, 1993
"... We study Girard's Linear Logic from the point of view of giving a concrete computational interpretation of the logic, based on the Curry-Howard isomorphism. In the case of Intuitionistic Linear Logic, this leads to a refinement of the lambda calculus, giving finer control over order of evaluati ..."
Abstract
-
Cited by 318 (3 self)
- Add to MetaCart
We study Girard's Linear Logic from the point of view of giving a concrete computational interpretation of the logic, based on the Curry-Howard isomorphism. In the case of Intuitionistic Linear Logic, this leads to a refinement of the lambda calculus, giving finer control over order
A Linear Storage-Retrieval Policy for Robust Warehouse Management
, 2008
"... Assigning products to and retrieving them from proper storage locations in a unit-load warehouse are crucial in minimizing its operating cost. The problem becomes intractable when the warehouse faces uncertain demand in a dynamic setting. We assume a factor-based demand model in which demand for eac ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
linear decision rule, we can obtain a storage and retrieval policy by solving a moderate-size linear optimization problem. Surprisingly, despite imprecise specification of demand distributions, our computational studies suggest that the simple linear policy achieves close to the expected value given
Geometry Compression
"... This paper introduces the concept of Geometry Compression, allowing 3D triangle data to be represented with a factor of 6 to 10 times fewer bits than conventional techniques, with only slight losses in object quality. The technique is amenable to rapid decompression in both software and hardware imp ..."
Abstract
-
Cited by 350 (0 self)
- Add to MetaCart
implementations; if 3D rendering hardware contains a geometry decompression unit, application geometry can be stored in memory in compressed format. Geometry is first represented as a generalized triangle mesh, a data structure that allows each instance of a vertex in a linear stream to specify an average of two
Provable Data Possession at Untrusted Stores
, 2007
"... We introduce a model for provable data possession (PDP) that allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. The model generates probabilistic proofs of possession by sampling random sets of blocks from the serv ..."
Abstract
-
Cited by 302 (9 self)
- Add to MetaCart
in widely-distributed storage systems. We present two provably-secure PDP schemes that are more efficient than previous solutions, even when compared with schemes that achieve weaker guarantees. In particular, the overhead at the server is low (or even constant), as opposed to linear in the size of the data
Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage
, 2013
"... Let D be a set of n disks in the plane. We present a data structure of size O(n) that can compute, for any query point q, the largest disk in D that contains q, in O(log n) time. The structure can be constructed in O(n log³ n) time. The optimal storage and query time of the structure improve several ..."
Abstract
- Add to MetaCart
Let D be a set of n disks in the plane. We present a data structure of size O(n) that can compute, for any query point q, the largest disk in D that contains q, in O(log n) time. The structure can be constructed in O(n log³ n) time. The optimal storage and query time of the structure improve
Optimal search in planar subdivisions
- SIAM JOURNAL OF COMPUTING, VOLTUNE
, 1983
"... A planar subdivision is any partition of the plane into (possibly unbounded) polygonal regions. The subdivision search problem is the following: given a subdivision S with n line segments and a query point P, determine which region of S contains P. We present a practical algorithm for subdivision s ..."
Abstract
-
Cited by 273 (3 self)
- Add to MetaCart
search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely O (log n) search time with O (n) storage. Our subdivision search structure can be constructed in linear time from the subdivision representation used in many
A cost-effective, high-bandwidth storage architecture
- In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS
, 1998
"... (NASD) storage architecture, prototype implementations oj NASD drives, array management for our architecture, and three,filesystems built on our prototype. NASD provides scal-able storage bandwidth without the cost of servers used primarily,fijr trut&rring data from peripheral networks (e.g. SCS ..."
Abstract
-
Cited by 197 (12 self)
- Add to MetaCart
(NASD) storage architecture, prototype implementations oj NASD drives, array management for our architecture, and three,filesystems built on our prototype. NASD provides scal-able storage bandwidth without the cost of servers used primarily,fijr trut&rring data from peripheral networks (e
Nonlinear Neural Networks: Principles, Mechanisms, and Architectures
, 1988
"... An historical discussion is provided of the intellectual trends that caused nineteenth century interdisciplinary studies of physics and psychobiology by leading scientists such as Helmholtz, Maxwell, and Mach to splinter into separate twentieth-century scientific movements. The nonlinear, nonstatio ..."
Abstract
-
Cited by 262 (21 self)
- Add to MetaCart
, nonstationary, and nonlocal nature of behavioral and brain data are emphasized. Three sources of contemporary neural network research-the binary, linear, and continuous-nonlinear models-are noted. The remainder of the article describes results about continuous-nonlinear models: Many models of content
eNVy: A Non-Volatile, Main Memory Storage System
, 1994
"... This paper describes the architecture of eNVy, a large non-volatile main memory storage system built primarily with Flash memory. eNVy presents its storage space as a linear, memory mapped array rather than as an emulated disk in order to provide an efficient and easy to use software interface. Flas ..."
Abstract
-
Cited by 176 (1 self)
- Add to MetaCart
This paper describes the architecture of eNVy, a large non-volatile main memory storage system built primarily with Flash memory. eNVy presents its storage space as a linear, memory mapped array rather than as an emulated disk in order to provide an efficient and easy to use software interface
Results 1 - 10
of
3,525
