1439 search results - page 200 / 288 » Fast approximation of centrality |
DBKDA
2010
IEEE
13 years 8 months ago
2010
IEEE
—Emerging Web2.0 applications such as virtual worlds or social networking websites strongly differ from usual OLTP applications. First, the transactions are encapsulated in an AP...
SSDBM
2008
IEEE
14 years 4 months ago
2008
IEEE
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
SIGMOD
2007
ACM
14 years 10 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
IPPS
2009
IEEE
14 years 4 months ago
2009
IEEE
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...