Results 11 - 20
of
16,099
Table 1: Online Commercial Intention vs Three Search Goal Categories
2006
"... In PAGE 1: ... Secondly, OCI of a search user can be seen as another independent dimension of search intention besides the three categories: Navigational, Informational and Transactional / Resource. Table1 shows that Online Commercial Intention (OCI) can cover all three of the Copyright is held by the World Wide Web Conference Committee (IW3C2). Distribution of these papers is limited to classroom use, and personal use by others.... ..."
Cited by 4
Table 4. Asymptotic lower bounds for online simplex range searching using O(m) space.
1999
"... In PAGE 31: ... Erickson apos;s techniques also imply nontrivial lower bounds for online and o ine halfspace emptiness searching, but with a few exceptions, these are quite weak. Table4 summarizes the best known lower bounds for online simplex queries, and Table 5 summarizes the best known lower bounds for o ine simplex range searching. Lower bounds for emptiness problems apply to counting and reporting problems as well.... ..."
Cited by 205
Table 4. Asymptotic lower bounds for online simplex range searching using O(m)space.
"... In PAGE 31: ... Erickson apos;s techniques also imply nontrivial lower bounds for online and o ine halfspace emptiness searching, but with a few exceptions, these are quite weak. Table4 summarizes the best known lower bounds for online simplex queries, and Table 5 summarizes the best known lower bounds for o ine simplex range searching. Lower bounds for emptiness problems apply to counting and reporting problems as well.... ..."
Table III.2. Brief description of the major search engines providing search features in online news environments (November 1999).
Table 1: Lower bounds for difierent versions of the static on-line range searching problem using O(m) storage.
2007
"... In PAGE 4: ...n a relatively easy way. These models are better suited for describing algorithms and upper bounds. In the following, we will examine the models of computation that have been used to obtain nontrivial lower bounds in range searching. Table1 summarizes the best known lower bounds for difierent variations of non-orthogonal range searching problems. Many of the following results for the non-orthogonal case have their orthogonal counterparts [53, 23, 24] as well.... ..."
TABLE 2: SEARCH STRATEGIES USED WHEN LOOKING FOR TAX FORMS ONLINE
2003
Cited by 2
Table 5: Comparison between unpaired and paired methods on the mountain car task. (All on-line figures for Random Search and DSM are calculated using the on-line max criterion.)
2002
Cited by 9
Table 5: Comparison between unpaired and paired methods on the mountain car task. (All on-line figures for Random Search and DSM are calculated using the on-line max criterion.)
Table 1. Portuguese major online publications according to subject, available archive, search engine and periodicity.
1999
"... In PAGE 3: ...fficiency of NewsSearch. Finally, we present our conclusions and directions for future work. II. Indexing on the Internet In April, 1999, we queried Altavista [16] for all the documents from any of the Portuguese online publications listed in Table1 dated between February 1, 1999 and April 1, 1999. The answer ranged from AltaVista found about 1 Web pages for you to Altavista found no document matching your query .... ..."
Cited by 1
Results 11 - 20
of
16,099