Results 1  10
of
257,509
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 798 (0 self)
 Add to MetaCart
A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general
Efficient Diversification of Topk Queries over Bounded Regions ⋆ Efficient diversification of topk queries
"... over bounded regions ..."
Evaluating Topk Queries over WebAccessible Databases
 ACM TRANS. ON DATABASE SYSTEMS
, 2004
"... ... In this article, we study how to process topk queries efficiently in this setting, where the attributes for which users specify target values might be handled by external, autonomous sources with a variety of access interfaces. We present a sequential algorithm for processing such queries, but ..."
Abstract

Cited by 253 (15 self)
 Add to MetaCart
, but observe that any sequential topk query processing strategy is bound to require unnecessarily long query processing times, since web accesses exhibit high and variable latency. Fortunately, web sources can be probed in parallel, and each source can typically process concurrent requests, although sources
Topk Diversity Queries over Bounded Regions
, 2013
"... Topk diversity queries over objects embedded in a lowdimensional vector space aim to retrieve the best k objects that are both relevant to given user’s criteria and well distributed over a designated region. An interesting case is provided by spatial Web objects, which are produced in great quanti ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Topk diversity queries over objects embedded in a lowdimensional vector space aim to retrieve the best k objects that are both relevant to given user’s criteria and well distributed over a designated region. An interesting case is provided by spatial Web objects, which are produced in great
Comparing top k lists
 In Proceedings of the ACMSIAM Symposium on Discrete Algorithms
, 2003
"... Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of these latter distance measures, we show that they are “almost ” a metric in the following two seemingly unrelated aspects: ( ..."
Abstract

Cited by 272 (4 self)
 Add to MetaCart
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of these latter distance measures, we show that they are “almost ” a metric in the following two seemingly unrelated aspects
Topk Query Evaluation with Probabilistic Guarantees
 In VLDB
, 2004
"... Topk queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known generalpurpose algorithm for evaluating topk queries is Fagin’s threshold algorithm (TA). Since the user’s goal behind topk queries is to i ..."
Abstract

Cited by 105 (16 self)
 Add to MetaCart
Topk queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known generalpurpose algorithm for evaluating topk queries is Fagin’s threshold algorithm (TA). Since the user’s goal behind topk queries
Topk Set Similarity Joins
"... Abstract — Similarity join is a useful primitive operation underlying many applications, such as near duplicate Web page detection, data integration, and pattern recognition. Traditional similarity joins require a user to specify a similarity threshold. In this paper, we study a variant of the simil ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
of the similarity join, termed topk set similarity join. It returns the topk pairs of records ranked by their similarities, thus eliminating the guess work users have to perform when the similarity threshold is unknown before hand. An algorithm, topkjoin, is proposed to answer topk similarity join efficiently
Topk Multiclass SVM
"... Class ambiguity is typical in image classification problems with a large number of classes. When classes are difficult to discriminate, it makes sense to allow k guesses and evaluate classifiers based on the topk error instead of the standard zeroone loss. We propose topk multiclass SVM as a dire ..."
Abstract
 Add to MetaCart
direct method to optimize for topk performance. Our generalization of the wellknown multiclass SVM is based on a tight convex upper bound of the topk error. We propose a fast optimization scheme based on an efficient projection onto the topk simplex, which is of its own interest. Experiments on five
Efficient TopK Query Calculation in Distributed Networks
 In PODC
, 2004
"... This paper presents a new algorithm to answer topk queries (e.g. “find the k objects with the highest aggregate values”) in a distributed network. Existing algorithms such as the Threshold Algorithm [FLN01] consume an excessive amount of bandwidth when the number of nodes, m, is high. We propose a ..."
Abstract

Cited by 79 (0 self)
 Add to MetaCart
This paper presents a new algorithm to answer topk queries (e.g. “find the k objects with the highest aggregate values”) in a distributed network. Existing algorithms such as the Threshold Algorithm [FLN01] consume an excessive amount of bandwidth when the number of nodes, m, is high. We propose a
Extracting redundancyaware topk patterns
 In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, 2006
"... Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance is usually defined by the context of applications. Previous studies have been concentrating on how to compute topk sign ..."
Abstract

Cited by 36 (3 self)
 Add to MetaCart
solution with performance bound O(log k) (with conditions on redundancy), where k is the number of reported patterns. The direct usage of redundancyaware topk patterns is illustrated through two real applications: disk block prefetch and document theme extraction. Our method can also be applied
Results 1  10
of
257,509