360 search results - page 23 / 72 » Dynamic Sample Selection for Approximate Query Processing |
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
— High performance and compliant robot control requires accurate dynamics models which cannot be obtained analytically for sufficiently complex robot systems. In such cases, mac...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
WSDM
2009
ACM
14 years 3 months ago
2009
ACM
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
ISPDC
2010
IEEE
13 years 7 months ago
2010
IEEE
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...