A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Frequency computation and bounded queries
1996
Theoretical Computer Science
Preserved Fulltext
There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. ...
For a general set A we have matching upper and lower bounds on f that depend on coding theory. ...
Acknowledgements We would like to thank Richard Chang, James Foster, Martin Kummer, Georgia Martin, Nick Reingold, Dan Spielman, Frank Stephan, and two anonymous referees for proofreading and helpful comments ...
doi:10.1016/0304-3975(95)00149-2
fatcat:ex3csqyeyvgsrgk3pq6oyn6ozq
Frequency computation and bounded queries
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. ...
For a general set A we have matching upper and lower bounds on f that depend on coding theory. ...
Acknowledgements We would like to thank Richard Chang, James Foster, Martin Kummer, Georgia Martin, Nick Reingold, Dan Spielman, Frank Stephan, and two anonymous referees for proofreading and helpful comments ...
doi:10.1109/sct.1995.514852
dblp:conf/coco/BeigelGK95
fatcat:5vwaa4meozdv3jrjdtt7knwjsu
Optimal Top-K Query Processing: Sampling and Dynamic Approach
English
2014
International Journal of Engineering Trends and Technoloy
English
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Thus the proposed approach allows sharing computation among multiple top-k queries and generates best plan of query execution. ...
to high computation cost and inaccurate response from the system. ...
Acknowledgment I would like to thank Dr.B.Bharathi, Head of the Department, Department of Computer Science and Engineering, Mr.rajeesh kumar for her encouragement and support. ...
doi:10.14445/22315381/ijett-v8p295
fatcat:fft5kuhuirak5ndw4rcclb4biu
Optimizing Multi-Top-k Queries over Uncertain Data Streams
2013
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we formulate various types of sharing among multiple top-k queries over uncertain data streams based on the frequency upper bound of each top-k query. ...
In many real applications, multiple top-k queries are registered in the system. Sharing the results of these queries is a key factor in saving the computation cost and providing real time response. ...
For queries with different frequency upper bounds, our objective is to share computation among queries that have different frequency upper bounds, which include the second and the third types of queries ...
doi:10.1109/tkde.2012.126
fatcat:jffgxtobbvg45c2qe5nlp2q3wy
Improving Quantum Clocks via Semidefinite Programming
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We consider arbitrary prior frequency knowledge and compare clocks with varying numbers of ions and queries interlaced with unitary control. ...
These clocks also provide a greater degree of control, because before and after clock queries, we are able to apply chosen unitary operations and measurements. ...
Acknowledgments This paper is a contribution of the National Institute of Standards and Technology and not subject to U.S. copyright. ...
arXiv:1107.5347v1
fatcat:27r4r43qjbb5xeel3zpryd3z5e
Linear-Space Data Structures for Range Mode Query in Arrays
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We then describe three additional linear-space data structures that provide O(k), O(m), and O(|j-i|) query time, respectively, where k denotes the number of distinct elements in A and m denotes the frequency ...
Each query consists of an input pair of indices (i, j) for which a mode of A[i:j] must be returned. ...
The authors thank Peyman Afshani, Timothy Chan, Francisco Claude, Meng He, Ian Munro, Patrick Nicholson, Matthew Skala, and Norbert Zeh for discussing various topics related to range searching. ...
arXiv:1101.4068v1
fatcat:sie3ravdpfhyre272sjpy6j2pe
Cell Probe Lower Bounds and Approximations for Range Mode
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We describe a linear space data structure that supports 3-approximate range mode queries in constant time, and a data structure that uses O( n ε ) space and supports (1 + ε)-approximation queries in O( ...
We prove that any data structure that uses S memory cells of w bits needs Ω( log n log(Sw/n) ) time to answer a range mode query. Secondly, we consider the related range k-frequency problem. ...
The i'th query computes the frequency R i of the mode between these two indices. ...
doi:10.1007/978-3-642-14165-2_51
fatcat:kg5i4hedrve7xpvclnqhaytk6i
Range majority in constant time and linear space
2013
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This result is interesting since other similar range query problems based on frequency have nearly logarithmic lower bounds on query time when restricted to linear space. $ This research was supported ...
We further generalize this problem by defining range α-majority queries: given a query range [i..j], return all the elements in the subarray A[i..j] with frequency greater than α(j − i + 1). ...
Range Mode, Frequency, and Majority Queries. Krizanc et al. ...
doi:10.1016/j.ic.2012.10.011
fatcat:5trfju5cynhydfddba4fmy6lam
Range Majority in Constant Time and Linear Space
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This result is interesting since other similar range query problems based on frequency have nearly logarithmic lower bounds on query time when restricted to linear space. $ This research was supported ...
We further generalize this problem by defining range α-majority queries: given a query range [i..j], return all the elements in the subarray A[i..j] with frequency greater than α(j − i + 1). ...
Range Mode, Frequency, and Majority Queries. Krizanc et al. ...
doi:10.1007/978-3-642-22006-7_21
fatcat:jpm4rjxryvfi5par6anjkek3nm
Colored Range Queries and Document Retrieval
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper we give improved time and space bounds for three important one-dimensional colored range queries -colored range listing, colored range top-k queries and colored range counting -and, thus, ...
Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information retrieval. ...
The space bound is the sum of the space bounds and the time bound per reported color is O(t acc + t enum + t rank ), the latter term for computing frequencies. ...
doi:10.1007/978-3-642-16321-0_7
fatcat:ego734iu7zd2xnvrnwvip5k2ny
Colored range queries and document retrieval
2013
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper we give improved time and space bounds for three important one-dimensional colored range queries -colored range listing, colored range top-k queries and colored range counting -and, thus, ...
Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information retrieval. ...
The space bound is the sum of the space bounds and the time bound per reported color is O(t acc + t enum + t rank ), the latter term for computing frequencies. ...
doi:10.1016/j.tcs.2012.08.004
fatcat:bc36cwxqovd5jflbruydfyfmia
An Inductive Database for Mining Temporal Patterns in Event Sequences
2005
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This algorithm is extensively used to compute the version spaces of symbol sequences [De Raedt and Kramer, 2001] . It computes the bounds of the version space from a conjunction of constraints. ...
These algorithms require the prior computation of frequent and maximal chronicles for each event sequence used in the query. ...
dblp:conf/ijcai/VautierCQ05
fatcat:flwgh2f3kjdfzjorowyaoiscuy
Space Lower Bounds for Itemset Frequency Sketches
2016
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Given a database, computing the fraction of rows that contain a query itemset or determining whether this fraction is above some threshold are fundamental operations in data mining. ...
A uniform sample of rows is a good sketch of the database in the sense that all sufficiently frequent itemsets and their approximate frequencies are recoverable from the sample, and the sketch size is ...
This algorithm computes and stores the results to all possible queries. ...
doi:10.1145/2902251.2902278
dblp:conf/pods/LibertyMTU16
fatcat:ex7vgevns5aqljvc2elcruyqki
The quantum complexity of approximating the frequency moments
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Here we study the quantum complexity of approximately computing the frequency moments in two settings. ...
In the query complexity setting, we wish to minimise the number of queries to the input used to approximate F_k up to relative error ϵ. ...
I would also like to thank two anonymous referees for their careful and helpful comments. This work was supported by EPSRC Early Career Fellowship EP/L021005/1. ...
arXiv:1505.00113v3
fatcat:yb74ugebinexrdx3wmcccqx7lq
Finding top-k similar graphs in graph databases
2012
Proceedings of the 15th International Conference on Extending Database Technology - EDBT '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Since computing the MCS of two graphs is NP-hard, we propose an algorithm to answer the top-k graph similarity query using two distance lower bounds with different computational costs, in order to reduce ...
the number of MCS computations. ...
Given q and g, we can compute a rough upper bound of |E(mcs(q, g))| based on the frequency of distinct edges. ...
doi:10.1145/2247596.2247650
dblp:conf/edbt/ZhuQYC12
fatcat:2qtogdcpubfutdpqgdnldajdqa
« Previous
Showing results 1 — 15 out of 79,530 results