Filters








130,491 Hits in 6.3 sec

If I Had a Million Queries [chapter]

Ben Carterette, Virgil Pavlu, Evangelos Kanoulas, Javed A. Aslam, James Allan
2009 Lecture Notes in Computer Science  
the same results as a much larger sample of queries.  ...  In this work we analyze a sample of queries categorized by length and corpus-appropriateness to determine the right proportion needed to distinguish between systems.  ...  First, we consider each document i to have a distribution of relevance p(X i ). If the document has been judged, then p(x i ) = 1.  ... 
doi:10.1007/978-3-642-00958-7_27 fatcat:ikc7siy45jcj5a5y32fnnoiy5u

Nearest Keyword Set Search in Multi-dimensional Datasets [article]

Vishwakarma Singh, Ambuj K. Singh
2014 arXiv   pre-print
For these datasets, we study queries that ask for the tightest groups of points satisfying a given set of keywords.  ...  Our scalability tests on datasets of sizes up to 10 million and dimensions up to 100 for queries having up to 9 keywords show that ProMiSH scales linearly with the dataset size, the dataset dimension,  ...  ProMiSH-E had a query time of 29 seconds and ProMiSH-A had a query time of 6 seconds for queries of size 9 on a dataset of 10 million points.  ... 
arXiv:1409.3867v1 fatcat:e6gso4wdonb6nkq27hedorpz5e

Page 167 of Notes and Queries Vol. 12, Issue 296 [page]

1909 Notes and Queries  
‘We had a period of bad trade last year, and the shortfall in our revenue was only a million and a half.  ...  Queries.  ... 

Google Scholar to overshadow them all? Comparing the sizes of 12 academic search engines and bibliographic databases

Michael Gusenbauer
2018 Scientometrics  
Iterative query optimization makes it possible to identify a maximum number of hits for most ASEBDs.  ...  By our estimation Google Scholar, with 389 million records, is currently the most comprehensive academic search engine.  ...  link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/s11192-018-2958-5 fatcat:gg6yyil5wbbodoyzvigwsr5ena

Auditing Search Engines for Differential Satisfaction Across Demographics

Rishabh Mehrotra, Ashton Anderson, Fernando Diaz, Amit Sharma, Hanna Wallach, Emine Yilmaz
2017 Proceedings of the 26th International Conference on World Wide Web Companion - WWW '17 Companion  
In this paper, we present a framework for internally auditing such services for differences in user satisfaction across demographic groups, using search engines as a case study.  ...  (A search impression is a unique view of a results page presented to a user in response to a query.) These queries were issued by 4 million users over 17 million sessions.  ...  −1 if SCC i − SCC j > 2 return +1 if SCC j − SCC i > 2 return −1 if GU i − GU j > 0.2 and SCC i − SCC j > 1 return +1 if GU j − GU i > 0.2 and SCC j − SCC i > 1 return −1 else return 0 We provide the  ... 
doi:10.1145/3041021.3054197 dblp:conf/www/MehrotraADSWY17 fatcat:zzjtzgp6cvhuddgfuhkhlycume

Practical Nearest Neighbor Search in the Plane [chapter]

Michael Connor, Piyush Kumar
2010 Lecture Notes in Computer Science  
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory and faster than the state  ...  We also show that if the query comes from a doubling metric, our queries are bounded by O(log n) query time in expectation.  ...  If this ball is empty, then v * ∈ Nbr(v i ) which is a contradiction of the Delaunay property of the graph.  ... 
doi:10.1007/978-3-642-13193-6_42 fatcat:u5fvlyvnrjbdxdehqukx2hxqn4

Page 83 of Notes and Queries Vol. 163, Issue 5 [page]

1933 Notes and Queries  
said the Farmer, the business I find would have been NOTES AND QUERIES. concluded without an if had you been as ready | to do justice to others as to exact it from them.  ...  I must in- quire into the affair; and if—And if!  ... 

Range Thresholding on Streams

Miao Qiao, Junhao Gan, Yufei Tao
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
A query registers an interval, and must be notified as soon as a certain number of incoming elements fall into the interval.  ...  This paper studies a type of continuous queries called range thresholding on streams (RTS). Imagine the stream as an unbounded sequence of elements each of which is a real value.  ...  Our algorithm ensures that if a query moves from Ti to T i ′ , it is always due to Line 3, which must have destroyed Ti and rebuilt T i ′ .  ... 
doi:10.1145/2882903.2915965 dblp:conf/sigmod/QiaoGT16 fatcat:tll445zshbci7c3mzenlgla3xq

Breaking up school

J. Evans
1940 Notes and Queries  
Whitaker, 1937, states that Russia had an approximate population of one hundred and eight million, one hundred thousand, so if this is correct, the two million given above represents a very small proportion  ...  I was stationed at a Texas flying field during the last war. We used the term “ bale out” then if my memory serves me right.  ... 
doi:10.1093/nq/179.13.223d fatcat:kwf633rua5arhpjhk42o7jjynu

Queries and Minor Notes

1923 Journal of the American Medical Association (JAMA)  
you say the mortality rate from nitrous oxid is one in a million.  ...  A leading anesthetist of Chicago (Morgan) told me sometime ago that he did not think there was a general hospital in that city that had not had one or more deaths from nitrous oxid.  ... 
doi:10.1001/jama.1923.02650110078043 fatcat:7uwe6thkxjex5n5xawg2jul5ri

When to use splay trees

Eric K. Lee, Charles U. Martel
2007 Software, Practice & Experience  
A splay tree moves accessed items to the root, see Section 2. § If 'ordered' operations are not necessary, hash tables are probably a better alternative.  ...  These results provide a better understanding of how cache performance affects query execution time.  ...  Assign it the access probability p i = (1/i) · 1/H n . (2) For all 1 million queries the probability query j is to key i is p i .  ... 
doi:10.1002/spe.813 fatcat:nt6sn4y3xbcfzjrane7yaahnpq

Raising teachers' awareness of corpora

Ana Frankenberg-Garcia
2010 Language Teaching  
I have only had time to describe a limited number of exercises addressing just a handful of issues that are important to bear in mind when using corpora.  ...  to observe that certain users tended to limit their searches to minute sub-corpora that did not return any hits for their queries, although they would have found relevant and useful hits if they had chosen  ... 
doi:10.1017/s0261444810000480 fatcat:2shwazdg3fh33cz2rpr33ogcfe

Spatial Indexing with a Scale Dimension [chapter]

Mike HÖrhammer, Michael Freeston
1999 Lecture Notes in Computer Science  
In our performance measurements on databases with up to 40 million spatial objects, the introduction of a scale dimension decreased I/O by up to 4 orders of magnitude.  ...  It is frequently the case that spatial queries require a result set of objects whose scale -however this may be more precisely defined -is the same as that of the query window.  ...  If a query Q i covering a proportion a i of the domain contains n objects of scale S i = S(Q i ) then the complete domain can typically be expected to contain roughly i a n such objects.  ... 
doi:10.1007/3-540-48482-5_6 fatcat:ggxhvzjam5fq7beahi3omnm2qm

Page 478 of Knowledge : A Monthly Record of Science Vol. 1, Issue 22 [page]

1882 Knowledge : A Monthly Record of Science  
system of calling a thousand millions a billion, a million millions a trilliun, and so on.  ...  That is to say, since a million is a thousand thousands, should we call a thousand millions a billion, and a thousand billions a trillion, and so on; or should we reckon a billion as a million millions  ... 

"Scratch a Russian and you find a tartar."

Herbert Southam
1940 Notes and Queries  
Whitaker, 1937, states that Russia had an approximate population of one hundred and eight million, one hundred thousand, so if this is correct, the two million given above represents a very small proportion  ...  I was stationed at a Texas flying field during the last war. We used the term “ bale out” then if my memory serves me right.  ... 
doi:10.1093/nq/179.13.223b fatcat:fyta43psvbg3xdzurm2drftfxe
« Previous Showing results 1 — 15 out of 130,491 results