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
Microscopy as a statistical, Rényi-Ulam, half-lie game: a new heuristic search strategy to accelerate imaging
2017
Scientific Reports
Preserved Fulltext
Other Versions
We show the cost of insisting on verification by positive result in search algorithms; for the zero-half-lie case bisectioning with verification incurs a 50% penalty in the average number of queries required ...
The case of half-lies, where one of two responses to a search query may be deceptive, introduces a richer, R\'enyi-Ulam problem and is particularly relevant to practical microscopy. ...
numbers CE140100003 and FT160100357). ...
doi:10.1038/s41598-017-14876-x
pmid:29116097
pmcid:PMC5677026
fatcat:qpyi7tcdynbnjn3qke6wfemr44
Searching games with errors—fifty years of coping with liars
2002
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 2018; you can also visit the original URL.
The file type is application/pdf.
This is a survey on searching with errors, considered in the framework of two-person games. ...
Finally, we discuss other search and computation problems with faulty feedback which are related to searching with errors. : S 0 3 0 4 -3 9 7 5 ( 0 1 ) 0 0 3 0 3 -6 Codes, noisy channels, and the RÃ enyi ...
Acknowledgements The author is grateful to Ferdinando Cicalese, Ugo Vaccaro, and to the anonymous referee for their useful suggestions and comments. ...
doi:10.1016/s0304-3975(01)00303-6
fatcat:xmon7re6yrhy3e65efbrmduooe
Filtering Search: A New Approach to Query-Answering
1986
SIAM journal on computing (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 2009; you can also visit the original URL.
The file type is application/pdf.
The approach which we take is very general and rests on a new concept called filtering search. ...
We introduce a new technique for solving problems of the following form: preprocess a set of objects so that those satisfying a given property with respect to a query object can be listed very effectively ...
I wish to thank Jon Bentley, Herbert Edelsbrunner, Janet Incerpi, and the anonymous referees for many valuable comments. ...
doi:10.1137/0215051
fatcat:6in2i7xl25exxohwqxwokwqiw4
Filtering search: A new approach to query-answering
1983
24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
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 2009; you can also visit the original URL.
The file type is application/pdf.
The approach which we take is very general and rests on a new concept called filtering search. ...
We introduce a new technique for solving problems of the following form: preprocess a set of objects so that those satisfying a given property with respect to a query object can be listed very effectively ...
I wish to thank Jon Bentley, Herbert Edelsbrunner, Janet Incerpi, and the anonymous referees for many valuable comments. ...
doi:10.1109/sfcs.1983.17
dblp:conf/focs/Chazelle83
fatcat:hqsgxyiqxbbr3mzmkr2n3lipai
Connected component and simple polygon intersection searching
[chapter]
1993
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.
The segment intersectionsearching problem, in which one wants to report all segments of S intersecting a query segment, is a special case of the colored segment intersection searching because, by coloring ...
By coloring the segments of S i with the color i, we can reduce it to colored segment intersection searching. ...
Searching TA, with the endpoints/3 and ~ of ~, we compute O (log n) maximal subtrees of TA~ that lie between the search paths to/3 and ~. ...
doi:10.1007/3-540-57155-8_234
fatcat:36kli7qzmzeulbv7ysf4zrar4e
Connected Component and Simple Polygon Intersection Searching
1996
Algorithmica
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.
The segment intersectionsearching problem, in which one wants to report all segments of S intersecting a query segment, is a special case of the colored segment intersection searching because, by coloring ...
By coloring the segments of S i with the color i, we can reduce it to colored segment intersection searching. ...
Searching TA, with the endpoints/3 and ~ of ~, we compute O (log n) maximal subtrees of TA~ that lie between the search paths to/3 and ~. ...
doi:10.1007/s004539900033
fatcat:nj2vd4pdo5c2hmo54w55fy3u2q
Connected component and simple polygon intersection searching
1996
Algorithmica
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.
The segment intersectionsearching problem, in which one wants to report all segments of S intersecting a query segment, is a special case of the colored segment intersection searching because, by coloring ...
By coloring the segments of S i with the color i, we can reduce it to colored segment intersection searching. ...
Searching TA, with the endpoints/3 and ~ of ~, we compute O (log n) maximal subtrees of TA~ that lie between the search paths to/3 and ~. ...
doi:10.1007/bf01940884
fatcat:btyopve26jeipftpr3bbqjzj6i
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
2012
SIAM journal on computing (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 2017; you can also visit the original URL.
The file type is application/pdf.
For a point x ∈ R, let S(x) ⊆ S be the set of intervals that contain x. Given a point q ∈ R, the stabbing-semigroup query asks for computing s∈S(q) ω(s). ...
Alternatively, by using an interval tree [9] one can obtain a linear-size data structure that supports both insertions and deletions in O(log n) time but requires O(log 2 n) time to answer a query. ...
The authors thank Mihai Pǎtraşcu for helpful discussions on the lower bound of the problem. They also thank two anonymous referees for their useful comments. ...
doi:10.1137/10078791x
fatcat:vgp5elh4wvfc5btjdacbxqeq5e
Largest components in random hypergraphs
[article]
2014
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.
Our proof extends the recent short proof for the graph case by Krivelevich and Sudakov which makes use of a depth-first search to reveal the edges of a random graph. ...
In this paper we consider j-tuple-connected components in random k-uniform hypergraphs (the j-tuple-connectedness relation can be defined by letting two j-sets be connected if they lie in a common edge ...
Thus τ P defines a probability distribution on N. Lemma 16. For any m, r, s ∈ N and 1/r ≥ q ∈ R, Pr(τ r·Bi(m,q) ≤ rs) ≥ Pr(τ Bi(rm,q) ≤ s). Proof. ...
arXiv:1412.6366v1
fatcat:ck3txfp67vduzmvmch4yzpoasa
The size of the giant component in random hypergraphs
[article]
2015
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.
In this paper we build on this and determine the asymptotic size of the unique giant component. ...
The phase transition in the size of the giant component in random graphs is one of the most well-studied phenomena in random graph theory. ...
We first borrow a lemma from [5] , which states that we may pick out a subsequence of queries and treat it like an interval of the search process. ...
arXiv:1501.07835v1
fatcat:j67wz2bklrdjtbpqoakd2xygoy
An Efficient Indexing Approach for Continuous Spatial Approximate Keyword Queries over Geo-Textual Streaming Data
2019
ISPRS International Journal of Geo-Information
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 2019; you can also visit the original URL.
The file type is application/pdf.
with MHR-tree while saving 41.66% maintenance cost on average, (3) the GPU-aided AP-tree + can attain an average speedup of 5.76× compared to AP-tree + , and (4) the GPU-CPU data communication scheme can ...
Furthermore, a m i n - w i s e parallel hashing algorithm with a scheme of data parallel and a GPU-CPU data communication method based on a four-stage pipeline way have been used to optimize the performance ...
The k 2 -node points to two query nodes (i.e, one query node contains q 6 , and the other holds q 3 and q 10 ). ...
doi:10.3390/ijgi8020057
fatcat:aebnqztq7jc4fglkxyb5ovvc6u
Blind Seer: A Scalable Private DBMS
2014
2014 IEEE Symposium on Security and Privacy
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.
We support a rich query set, including searching on arbitrary boolean formulas on keywords and ranges, support for stemming, and free keyword searches over text fields. ...
We also support private and complex access policies, integrated in the search process so that a query with empty result set and a query that fails the policy are hard to tell apart. Design goals. ...
Any opinion, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. ...
doi:10.1109/sp.2014.30
dblp:conf/sp/PappasKVKMCGKB14
fatcat:muuma54ttnhktbsf3fakm2soom
Heuristics for optimum binary search trees and minimum weight triangulation problems
1989
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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we establish new bounds on the problem of constructing optimum binary search trees with zero-key access probabilities (with applications e.g. to point location problems). ...
They are carried over to binary search trees by proving a duality between optimum (m -I)-way search trees and minimum weight partitions of infinitely-flat semi-circular polygons into m-gons. ...
among all m-ary search trees for S. ...
doi:10.1016/0304-3975(89)90134-5
fatcat:tzi6zk3yaneglpb32h6plpeivq
Towards an extensible efficient event processing kernel
2012
Proceedings of the on SIGMOD/PODS 2012 PhD Symposium - PhD '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.
On the one hand, emerging user-centric applications, including computational advertising and selective information dissemination, demand determining and presenting to an enduser only the most relevant ...
On the other hand, applications in real-time data analysis, including computational finance and intrusion detection, demand meeting stringent subsecond processing requirements and providing high-frequency ...
., a bag of ω, τ tuples, where ω is an event at time τ ) and a collection of continuous SQL queries Q, the SQL queries are continuously evaluated over the event stream. ...
doi:10.1145/2213598.2213602
dblp:conf/sigmod/Sadoghi12
fatcat:dqbmivxweva77nth3vkepgs2iy
The suffix-signature method for searching for phrases in text
1998
Information Systems
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 2018; you can also visit the original URL.
The file type is application/pdf.
Collision handling Since we assume tliat operatio~is on signature set Q are niuch cheaper than on worrl set W. we do uiost searching on Q and do as little as possible on W. ...
The percentages of word search queries of simple search qiieries. pl~rase search qiieries of simple searclies. and power searcli queries are 54.0%. 19.5 7%. and 30.5%. respectively. ...
Two rriodels U T L~~O T~~I . iruord siy7~atures and ~m i f r w m uiorrl signutures. as described in Section 5 -3 -4. for ii~isiiccessfiil searches are also iised in oiir experimerits. ...
doi:10.1016/s0306-4379(98)00029-5
fatcat:wq45x3wgifejdbqfslqgxnhlha
« Previous
Showing results 1 — 15 out of 576 results