Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,977
A new representation for linear lists
- 9th ACM Symposium on Theory of Computing, Bolder CO
, 1977
"... We present a new data structure for maintaining a set of records in a linear list according to their key values. This data structure has the property that we can keep a number of fingers at points of interest in the key space (e.g., the beginning ..."
Abstract
-
Cited by 62 (2 self)
- Add to MetaCart
We present a new data structure for maintaining a set of records in a linear list according to their key values. This data structure has the property that we can keep a number of fingers at points of interest in the key space (e.g., the beginning
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that move-to-front is within a constant factor of optimum amo ..."
Abstract
-
Cited by 824 (8 self)
- Add to MetaCart
In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that move-to-front is within a constant factor of optimum
Limma: linear models for microarray data
- Bioinformatics and Computational Biology Solutions using R and Bioconductor
, 2005
"... This free open-source software implements academic research by the authors and co-workers. If you use it, please support the project by citing the appropriate journal articles listed in Section 2.1.Contents ..."
Abstract
-
Cited by 774 (13 self)
- Add to MetaCart
This free open-source software implements academic research by the authors and co-workers. If you use it, please support the project by citing the appropriate journal articles listed in Section 2.1.Contents
ABSTRACT ON THE OPTIMALITY OF THE COUNTER SCHEME FOR DYNAMIC LINEAR LISTS
, 1990
"... We consider policies that manage fixed-size dynamic linear lists, when the references follow the independent reference model. Wedefine the counter scheme, apolicy that keeps the records sorted by their access frequencies, and prove that among all deterministic policies it produces the least expected ..."
Abstract
- Add to MetaCart
We consider policies that manage fixed-size dynamic linear lists, when the references follow the independent reference model. Wedefine the counter scheme, apolicy that keeps the records sorted by their access frequencies, and prove that among all deterministic policies it produces the least
Verification of Dynamic Linear Lists for All Numbers of Processes
, 1998
"... In real-world design and verification of concurrent systems with many identical processes, the number of processes is never a factor in the system correctness. This paper embodies such an engineering reasoning to propose an almost automatic method to safely verify safety properties of such systems. ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
given bound. Our method can be applied to systems with dynamic linear lists of unknown number of processes. Processes can be deleted from or inserted at any position of the linear list during transitions. We have used our method to develop CQS constructing algorithms for two classes of concurrent
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract
-
Cited by 758 (41 self)
- Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number
An Asymptotic Optimality of the Transposition Rule for Linear Lists
, 2008
"... The transposition rule is an algorithm for self-organizing linear lists. Upon a request for a given item, the item is transposed with the preceding one. The cost of a request is the distance of the requested item from the beginning of the list. An asymptotic optimality of the rule with the respect t ..."
Abstract
- Add to MetaCart
The transposition rule is an algorithm for self-organizing linear lists. Upon a request for a given item, the item is transposed with the preceding one. The cost of a request is the distance of the requested item from the beginning of the list. An asymptotic optimality of the rule with the respect
The use of MMR, diversity-based reranking for reordering documents and producing summaries
- In SIGIR
, 1998
"... jadeQcs.cmu.edu Abstract This paper presents a method for combining query-relevance with information-novelty in the context of text retrieval and summarization. The Maximal Marginal Relevance (MMR) criterion strives to reduce redundancy while maintaining query relevance in re-ranking retrieved docum ..."
Abstract
-
Cited by 768 (14 self)
- Add to MetaCart
systems. However, the clearest advantage is demonstrated in constructing non-redundant multi-document summaries, where MMR results are clearly superior to non-MMR passage selection. 2 Maximal Marginal Relevance Most modem IR search engines produce a ranked list of retrieved documents ordered by declining
Mining Sequential Patterns: Generalizations and Performance Improvements
- RESEARCH REPORT RJ 9994, IBM ALMADEN RESEARCH
, 1995
"... The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-specified ..."
Abstract
-
Cited by 759 (5 self)
- Add to MetaCart
The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user
Results 1 - 10
of
2,977
