Results 11 - 20 of 21,240

Table 3. George scenario query time Average 95% Conf. Int.

in Providing Contextual Information to Pervasive Computing Applications
by Glenn Judd , Peter Steenkiste

Table 3. George scenario query time Average 95% Conf. Int.

in Providing Contextual Information to Pervasive Computing Applications
by unknown authors

Table A.1. Example scenario: runpeprot queries that returned true.

in A Security Model for Anonymous Credential Systems
by Andreas Pashalidis, Chris J. Mitchell

Table 3: Scenarios for organizer queries. Type Legend Combination

in Energy Management Schemes for Memory-Resident Database Systems
by Jayaprakash Pisharath, Alok Choudhary

Table 4: Percentage of People Preferring Each Query in Each Scenario Node Name Course Advice Travel Agency

in Generating Queries and Replies during Information-seeking Interactions
by Bhavani Raskutti, Ingrid Zukerman 1997
"... In PAGE 45: ...sking the customer to decide. This is usually cumbersome in the travel domain. For each scenario in each part of the questionnaire, the respondents were required to choose a preferred query. The percentage of people who chose each node for each scenario is shown in Table4 (the percentage which corresponds to the node chosen by radar is underlined). Nodes A, B and C represent the decision nodes at which the queries were directed in Figures 8 and 15.... ..."
Cited by 6

Table 4: Scenarios for TPC-H queries. Type Legend Combination

in Energy Management Schemes for Memory-Resident Database Systems
by Jayaprakash Pisharath, Alok Choudhary
"... In PAGE 8: ... For instance, P12 indicates that P1 is sequentially processed along with P2. The combination scenarios for TPC-H queries are shown in Table4 . The combinations shown in these tables are the prominent ones and the behavior of other combinations are very similar to these, hence, they are not included in this paper.... ..."

Table 1: Selectivity factors (SF) and update rates (number of updated objects per number of queries) of the usage scenarios

in Exploiting Type and Space in a Main Memory Query Engine
by Thomas Schwarz, Matthias Grossmann, Daniela Nicklas, Bernhard Mitschang
"... In PAGE 4: ... Hence, we analyze the experiments in Section 5 individually for each compo- nent. Table1 summarizes and quantifies these characteristics, which have been derived from the experiences with our service provisioning platform for context-aware applica- tions [24]. The term selectivity factor (SF) refers to the ratio of objects qualifying for the result set to the total number of objects (the data set size).... In PAGE 11: ... The usage scenarios provide the parameters describing typical workloads. Their minimum and maximum SFs (see Table1 ) define the integration limits. The surface function is weighted by the reciprocal of the multiplied selectivity factors.... ..."

Table 2: Query registration times (extended example scenario)

in Data Stream Sharing
by Alle Rechte Vorbehalten, Technischen Universität München, Richard Kuntschke, Richard Kuntschke, Bernhard Stegmaier, Bernhard Stegmaier, Alfons Kemper, Alfons Kemper, Lehrstuhl Informatik, Iii Datenbanksysteme, Technische Universität München, Technische Universität München 2005
Cited by 3

Table 3: Connectivity percentages for the average node in each scenario for the 52 query rounds.

in Mobile Distributed Information Retrieval For Highly-Partitioned Networks
by Katrina M. Hanna, Brian Neil Levine, R. Manmatha 2003
"... In PAGE 7: ... The ad hoc scenario has connectivity much less often for any sparse population. Table3 shows the percentage of times during the 52 query-roundsfor which no route could be found to the central IR server. The p2pir technique of- fered a high precision result when the ad hoc service of- fered none; when a route was available, the p2pir quality was not significantly worse when compared to ad hoc pre- cision.... In PAGE 7: ...0 in averaged precision shown. The 500m-by-500mfield offered almost no partitions (see Table3 ). However, degradation of the average service is extremely significant in sparser populations.... In PAGE 9: ... (Error bars indicate standard deviations.) The centralized node performed work equivalent to the connectivity rates ( Table3 ) times 49 (nodes). The ad hoc scenario also had costs associated with running AODV; these are shown in Figure 5 for the average node on a per-query-round basis for each area size.... ..."
Cited by 11

Table 3: Connectivity percentages for the average node in each scenario for the 52 query rounds.

in Mobile distributed information retrieval for highly-partitioned networks
by Katrina M. Hanna, Brian Neil, Levine R. Manmatha 2003
"... In PAGE 7: ... The ad hoc scenario has connectivity much less often for any sparse population. Table3 shows the percentage of times during the 52 query-roundsfor which no route could be found to the central IR server. The p2pir technique of- fered a high precision result when the ad hoc service of- fered none; when a route was available, the p2pir quality was not significantly worse when compared to ad hoc pre- cision.... In PAGE 7: ...0 in averaged precision shown. The 500m-by-500mfield offered almost no partitions (see Table3 ). However, degradation of the average service is extremely significant in sparser populations.... In PAGE 9: ... (Error bars indicate standard deviations.) The centralized node performed work equivalent to the connectivity rates ( Table3 ) times 49 (nodes). The ad hoc scenario also had costs associated with running AODV; these are shown in Figure 5 for the average node on a per-query-round basis for each area size.... ..."
Cited by 11
Results 11 - 20 of 21,240