Results 21 - 30 of 82,851

Table 5: Classification based on data structure applied for enabling ranged search and look-up complexity

in unknown title
by unknown authors 2006
"... In PAGE 20: ... Efficient query routing algorithm should exhibit following characteristics [55]: (i) routing load balance-every peer in the network on the average should route forward/route approximately same number of query messages; and (ii) low per-node state-each peer should maintain a small number of routing links hence limiting new peer join and peer state update cost. In Table5 , we summarize the query look-up complexity involved with the existing algorithms. How an MRQ request is routed over a DHT network is directly governed by the data distribution mechanism (ref to previous section).... ..."
Cited by 2

Table 5.6 The search efficiency of different thresholding methods for full-text resource selection of providers, 100 TREC queries.

in ABSTRACT Full-Text Federated Search in Peer-to-Peer Networks
by Jie Lu, Jie Lu

Table 1. Effect of efficient point localization.

in Accelerating Heuristic Search in Spatial Domains
by Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
"... In PAGE 15: ... Effect of efficient point localization. Table1 compares the performance for diagram construction (tc) and searching (ts) query points to the naive search scheme (tprime s). We posed as many queries as there were points, by giving a small offset to the original point coordinates.... ..."

Table 1: Search Efficiency of APS Search efficiency comparison

in COMBINING AGENT-BASED SUPPLY NET SIMULATION AND CONSTRAINT TECHNOLOGY FOR HIGHLY EFFICIENT SIMULATION OF SUPPLY NETWORKS USING APS SYSTEMS
by S. Chick, P. J. Sánchez, D. Ferrin, D. J. Morrice, Hartwig Baumgaertel, Ulrich John, Daimlerchrysler Ag
"... In PAGE 7: ... We illustrate this for a particular, but representative sample planning problem with 25 planning periods and 6 product types. Table1 and Figure 1 compare the efficiency of the Table 1: Search Efficiency of APS Search efficiency comparison ... ..."

Table 8: Comparison of search efficiency using the KIL, using separate indexes as proposed in [32], and using a simple inverted list. The KIL improved search efficiency significantly.

in Indexing Dataspaces
by Xin Dong, Alon Halevy
"... In PAGE 8: ... Performing the count would add a significant overhead to both of these techniques. Table8 shows the query-answering time using these three different indexes. It took 1.... ..."

Table 1. Search Efficiency Comparisons

in Conditional lexicographic orders in constraint satisfaction problems
by Richard J. Wallace, Nic Wilson 2006
"... In PAGE 13: ... 7.2 Experimental results Performance comparisons are given in Table1 . (Note that the number of values per domain is large in comparison with problems typically considered in this context and that there are numerous hard constraints.... In PAGE 13: ... For easy problems, staged lexical search was sometimes more efficient than branch and bound. This depended on the search order heuristic as well as the num- ber of conditional preference relations ( Table1 ). (Branch and bound does worse on these problems if a lexical variable ordering is used, in contrast to the results for staged lexical search shown in the table.... ..."
Cited by 1

Table 4). E-Measure: a composite measure of the precision and recall for a fixed number of retrieved results [32]. The intuition is that a user of a search engine is more interested in the first page of query results than in later pages. So, this measure considers only the first 32 retrieved models for every query and calculates the precision and recall over those results. The E-Measure is defined as [32, 19]:

in The Princeton Shape Benchmark
by Philip Shilane, Patrick Min, Michael Kazhdan, Thomas Funkhouser 2004
"... In PAGE 8: ...2 Base Classification Results In our first experiment, we used each of the 12 shape matching algorithms to compute the distances between all pairs of models in the test set and analyzed them with the benchmark evaluation tools to quantify the matching per- formance with respect to the base classification (the train- ing set was not used for training any of the algorithms). Figure 2 shows a precision-recall plot showing the micro- averaged retrieval results achieved for this experiment, and Table4 shows micro-averaged storage requirements, pro- cessing times, and retrieval statistics for each algorithm. We found that the micro and macro-average gave consistent re- sults, and we decided to present micro-averaged statistics.... In PAGE 9: ...6% -27.3% Table4 . Comparing 12 shape descriptors using the PSB base classification.... ..."
Cited by 69

TABLE VI ANOVA for search efficiency

in Behavior of Interconnected Subpopulations: Genetic Algorithms in a SIMD Environment
by D. Prabhu, B.P. Buckles, F.E. Petry
Cited by 1

Table 2. Search Times

in The Anatomy of a Large-Scale Hypertextual Web Search Engine
by Sergey Brin, Lawrence Page 1998
"... In PAGE 14: ... Our target is to be able to handle several hundred queries per second. Table2 has some sample query times from the current version of Google. They are repeated to show the speedups resulting from cached IO.... ..."
Cited by 1787

Table 2. Search Times

in The Anatomy of a Large-Scale Hypertextual Web Search Engine
by Sergey Brin, Lawrence Page 1998
"... In PAGE 14: ... Our target is to be able to handle several hundred queries per second. Table2 has some sample query times from the current version of Google. They are repeated to show the speedups resulting from cached IO.... ..."
Cited by 1787
Results 21 - 30 of 82,851