Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
173,650
2005. A compact data structure for searchable translation memories
- In 10th European Conference of the Association for Machine Translation (EAMT
"... In this paper we describe searchable trans-lation memories, which allow translators to search their archives for possible trans-lations of phrases. We describe how sta-tistical machine translation can be used to align subsentential units in a translation memory, and rank them by their proba-bility. ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
-bility. We detail a data structure that al-lows for memory-efficient storage of the index. We evaluate the accuracy of trans-lations retrieved from a searchable trans-lation memory built from 50,000 sentence pairs, and find a precision of 86.6 % for the top ranked translations. 1
Efficient Verification of Real-Time Systems: Compact Data Structure and State--Space Reduction
- In Proc. of the 18th IEEE Real-Time Systems Symposium
, 1997
"... During the past few years, a number of verification tools have been developed for real-time systems in the framework of timed automata (e.g. Kronos and Uppaal). One of the major problems in applying these tools to industrial-size systems is the huge memory-usage for the exploration of the state-spac ..."
Abstract
-
Cited by 64 (10 self)
- Add to MetaCart
-space of a network (or product) of timed automata, as the modelcheckers must keep information on not only the control structure of the automata but also the clock values specified by clock constraints. In this paper, we present a compact data structure for representing clock constraints. The data structure
Compact Data Structure and Scalable Algorithms for the Sparse Grid Technique
"... The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data structures, thus being far from well-suited for GPUs. In this paper, we describe optimizations that enable us to impleme ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data structures, thus being far from well-suited for GPUs. In this paper, we describe optimizations that enable us
CSTs (Covering Sharing Trees): Compact Data Structures for Parameterized Verification
- Software Tools for Technology Transfer, 2001. 98
"... The control state reachability problem is decidable for well-structured in finite-state systems like unbounded Petri Nets, Vector Addition Systems, Lossy Petri Nets, and Broadcast Protocols. An abstract algorithm that solves the problem is given in [A CJT96, FS01]. The algorithm computes the closure ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
the closure of the predecessor operator w.r.t. a given upward-closed set of target states. When applied to this class of verification problems, traditional (infinite-state) symbolic model checkers suffer from the state explosion problem even for very small examples. We provide a new data structure
A compact data structure for representing a dynamic multiset
"... Abstract We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, supports searches in O(lg n) worst-case time and updates in O(lg n) amortized time. Compared to earlier data structur ..."
Abstract
- Add to MetaCart
Abstract We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, supports searches in O(lg n) worst-case time and updates in O(lg n) amortized time. Compared to earlier data
A Compact Data Structure For The Interactive Navigation Into Arbitrary Meshes
"... The preprocessing of large meshes to allow and optimize interactive visualization implies a complete reorganization that often introduces a significant data growth. This is detrimental not only to storage or network transmission, but also to the efficiency of the visualization process itself because ..."
Abstract
- Add to MetaCart
because of the increasing gap between computing times and external access times. In this article, we try to reconcile lossless compression and visualization by proposing a data structure which radically reduces the size of the object while supporting a fast interactive navigation. In addition
The quadtree and related hierarchical data structures
- ACM Computing Surveys
, 1984
"... A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems, and robotics ..."
Abstract
-
Cited by 541 (12 self)
- Add to MetaCart
A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems
Bigtable: A distributed storage system for structured data
- IN PROCEEDINGS OF THE 7TH CONFERENCE ON USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION - VOLUME 7
, 2006
"... Bigtable is a distributed storage system for managing structured data that is designed to scale to a very large size: petabytes of data across thousands of commodity servers. Many projects at Google store data in Bigtable, including web indexing, Google Earth, and Google Finance. These applications ..."
Abstract
-
Cited by 1028 (4 self)
- Add to MetaCart
Bigtable is a distributed storage system for managing structured data that is designed to scale to a very large size: petabytes of data across thousands of commodity servers. Many projects at Google store data in Bigtable, including web indexing, Google Earth, and Google Finance. These applications
The X-tree: An index structure for high-dimensional data
- In Proceedings of the Int’l Conference on Very Large Data Bases
, 1996
"... In this paper, we propose a new method for index-ing large amounts of point and spatial data in high-dimensional space. An analysis shows that index structures such as the R*-tree are not adequate for indexing high-dimensional data sets. The major problem of R-tree-based index structures is the over ..."
Abstract
-
Cited by 592 (17 self)
- Add to MetaCart
In this paper, we propose a new method for index-ing large amounts of point and spatial data in high-dimensional space. An analysis shows that index structures such as the R*-tree are not adequate for indexing high-dimensional data sets. The major problem of R-tree-based index structures
Results 11 - 20
of
173,650
