1091 search results - page 109 / 219 » Approximation Algorithms for Data Placement Problems |
EJWCN
2010
13 years 2 months ago
2010
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
CIKM
1999
Springer
14 years 6 days ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Background knowledge is an important factor in privacy preserving data publishing. Probabilistic distributionbased background knowledge is a powerful kind of background knowledge w...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...