360 search results - page 10 / 72 » Dynamic Sample Selection for Approximate Query Processing |
TCOS
2010
13 years 6 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
EOR
2006
13 years 8 months ago
2006
The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-ma...
DKE
2006
13 years 8 months ago
2006
Hidden Web databases maintain a collection of specialised documents, which are dynamically generated in response to users' queries. The majority of these documents are genera...
SIGMETRICS
2011
ACM
12 years 11 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
DIS
2008
Springer
13 years 10 months ago
2008
Springer
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...