Results 1 - 10
of
12,511
Table 7.2: Pseudocode for the graph construction algorithm. x lt; y. The above sketch implies the O(n3) algorithm shown in Table 7.2. With the constraint y lt; x + c, it can be turned into a linear-time algorithm with a large constant factor. The algorithm is perhaps too simple: it doesn apos;t consider the e ect groups of tones have on temporal coherence. Also, di erent grouping cues interact in complex ways [10]. However, we believe it leads to plausible results as long as the functions fm and fr are reasonable. We have derived sample fr and fm functions in a slightly ad hoc manner, not to mention using common sense. The functions are
Table 10: Automatic ad hoc results
1995
"... In PAGE 12: ... citya2 is the same without expansion or passage retrieval. Table10 gives the o#0Ecial City ad hoc results. citya1 did better than citya2 on 35 of the topics.... ..."
Cited by 264
Table 2: Ad Hoc Results for 50 Queries
1997
"... In PAGE 4: ... 3.2 Ad-Hoc Retrieval Results Our official ad-hoc results are shown in Table2 for the 3 query types. Most unexpected is the finding that average precision values for very short queries derived from titles actually perform best with .... ..."
Cited by 18
Table 1: Automatic ad hoc results
1997
"... In PAGE 5: ... 4.2 Ad hoc runs These are summarised in Table1 . All reported runs used passage searching, whichgave gains of up to about 12#25 in average precision.... ..."
Cited by 4
Table 1: Applications of ad hoc networks
"... In PAGE 2: ... 1.1 Applications We summarize some current and future applications of ad hoc networks in Table1 . The applications listed in the table are sorted by their area of use, network devices, and communication model.... ..."
Cited by 1
Table 1: Ad-Hoc Results
1995
"... In PAGE 3: ... 3.2 Results A summary comparison of our approaches to ad-hoc retrieval averaged over the 50 queries in Q4 is tabulated in Table1 below. Compared with our standard approach pircs0, both of our enhancements in pircs1 and pircs2 are successful.... ..."
Cited by 20
Table 1: Baseline results of ad hoc task
2001
"... In PAGE 3: ...or basic content-based retrieval, only initial retrievals (i.e. without QE) were performed. Only those words in fields of Title/Subtitle/Passage were indexed. The initial retrieval results are summarized in Table1 and 2. We can see that the ad hoc retrieval results for TREC-9 query set are very promising.... In PAGE 3: ... This indicates the robustness and effectiveness of our new version of the Okapi system. The results in Table1 and 2 will also serve as the baseline in all experiments described below. The evaluation metric of ad hoc task is non- interpolated average precision.... ..."
Cited by 3
Table 1: Baseline results of ad hoc task
"... In PAGE 3: ...or basic content-based retrieval, only initial retrievals (i.e. without QE) were performed. Only those words in fields of Title/Subtitle/Passage were indexed. The initial retrieval results are summarized in Table1 and 2. We can see that the ad hoc retrieval results for TREC-9 query set are very promising.... In PAGE 3: ... This indicates the robustness and effectiveness of our new version of the Okapi system. The results in Table1 and 2 will also serve as the baseline in all experiments described below. The evaluation metric of ad hoc task is non- interpolated average precision.... ..."
Cited by 2
Table 12: Properties of ad hoc networking
"... In PAGE 10: ...able 11. Challenges in concurrent engineering.................................................................... 59 Table12 .... In PAGE 75: ... The union of these forms an arbitrary topology, which may change rapidly and unpredictably. Table12 shows the properties of ad hoc networking, adapted from (Thonet, 2004). 1.... ..."
Results 1 - 10
of
12,511