Results 1  10
of
11,756
An Upper Bound for Searching an Ordered List
, 2008
"... We present a probabilistic algorithm that in the blackbox model performs a search in an ordered list using 3/4 log N + O(1) queries, whereas classically, log N − O(1) is the best that can be achieved. Moreover, our algorithm does not rely on the Hadamard nor on the discrete Fourier transform. ..."
Abstract
 Add to MetaCart
We present a probabilistic algorithm that in the blackbox model performs a search in an ordered list using 3/4 log N + O(1) queries, whereas classically, log N − O(1) is the best that can be achieved. Moreover, our algorithm does not rely on the Hadamard nor on the discrete Fourier transform.
On the Ordered List Subgraph Embedding Problems
"... Abstract. In the (parameterized) Ordered List Subgraph Embedding problem (pOLSE) we are given two graphs G and H, each with a linear order defined on its vertices, a function L that associates with every vertex in G a list of vertices in H, and a parameter k. The question is to decide if we can emb ..."
Abstract
 Add to MetaCart
Abstract. In the (parameterized) Ordered List Subgraph Embedding problem (pOLSE) we are given two graphs G and H, each with a linear order defined on its vertices, a function L that associates with every vertex in G a list of vertices in H, and a parameter k. The question is to decide if we can
Aggregation of Multiple Judgments for Evaluating Ordered Lists
"... Abstract. Many tasks (e.g., search and summarization) result in an ordered list of items. In order to evaluate such an ordered list of items, we need to compare it with an ideal ordered list created by a human expert for the same set of items. To reduce any bias, multiple human experts are often use ..."
Abstract
 Add to MetaCart
Abstract. Many tasks (e.g., search and summarization) result in an ordered list of items. In order to evaluate such an ordered list of items, we need to compare it with an ideal ordered list created by a human expert for the same set of items. To reduce any bias, multiple human experts are often
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract

Cited by 578 (6 self)
 Add to MetaCart
We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order
Compare Ordered Lists with Weighted Overlap Score Description
, 2013
"... Description Detection of similarities between ordered lists of genes. Thereby, either simple lists can be compared or gene expression data can be used to deduce the lists. Significance of similarities is evaluated by shuffling lists or by resampling in microarray data, respectively. ..."
Abstract
 Add to MetaCart
Description Detection of similarities between ordered lists of genes. Thereby, either simple lists can be compared or gene expression data can be used to deduce the lists. Significance of similarities is evaluated by shuffling lists or by resampling in microarray data, respectively.
Video google: A text retrieval approach to object matching in videos
 In ICCV
, 2003
"... We describe an approach to object and scene retrieval which searches for and localizes all the occurrences of a user outlined object in a video. The object is represented by a set of viewpoint invariant region descriptors so that recognition can proceed successfully despite changes in viewpoint, ill ..."
Abstract

Cited by 1636 (42 self)
 Add to MetaCart
, illumination and partial occlusion. The temporal continuity of the video within a shot is used to track the regions in order to reject unstable regions and reduce the effects of noise in the descriptors. The analogy with text retrieval is in the implementation where matches on descriptors are pre
Cumulated Gainbased Evaluation of IR Techniques
 ACM Transactions on Information Systems
, 2002
"... Modem large retrieval environments tend to overwhelm their users by their large output. Since all documents are not of equal relevance to their users, highly relevant documents should be identified and ranked first for presentation to the users. In order to develop IR techniques to this direction, i ..."
Abstract

Cited by 694 (3 self)
 Add to MetaCart
along the ranked result list. The second one is similar but applies a discount factor on the relevance scores in order to devaluate lateretrieved documents. The third one computes the relativetothe ideal performance of IR techniques, based on the cumulative gain they are able to yield. The novel
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 transactiontime, and each transaction is a set of items. The problem is to discover all sequential patterns with a userspecified ..."
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 transactiontime, and each transaction is a set of items. The problem is to discover all sequential patterns with a user
The use of MMR, diversitybased reranking for reordering documents and producing summaries
 In SIGIR
, 1998
"... jadeQcs.cmu.edu Abstract This paper presents a method for combining queryrelevance with informationnovelty in the context of text retrieval and summarization. The Maximal Marginal Relevance (MMR) criterion strives to reduce redundancy while maintaining query relevance in reranking retrieved docum ..."
Abstract

Cited by 768 (14 self)
 Add to MetaCart
systems. However, the clearest advantage is demonstrated in constructing nonredundant multidocument summaries, where MMR results are clearly superior to nonMMR passage selection. 2 Maximal Marginal Relevance Most modem IR search engines produce a ranked list of retrieved documents ordered by declining
Finite Set Theory based on Fully Ordered Lists
"... We present a new finite set theory implementation for ACL2 wherein sets are implemented as fully ordered lists. This order unifies the notions of set equality and element equality by creating a unique representation for each set, which in turn enables nested sets to be trivially supported and elimin ..."
Abstract
 Add to MetaCart
We present a new finite set theory implementation for ACL2 wherein sets are implemented as fully ordered lists. This order unifies the notions of set equality and element equality by creating a unique representation for each set, which in turn enables nested sets to be trivially supported
Results 1  10
of
11,756