Sciweavers

57 search results - page 8 / 12
» Dynamic placement for clustered web applications
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 8 days ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
ICSM
2003
IEEE
15 years 5 months ago
Library Miniaturization Using Static and Dynamic Information
Moving to smaller libraries can be considered as a relevant task when porting software systems to limited-resource devices (e.g., hand-helds). Library miniaturization will be part...
Giuliano Antoniol, Massimiliano Di Penta
WWW
2010
ACM
15 years 2 days ago
Using a model of social dynamics to predict popularity of news
Popularity of content in social media is unequally distributed, with some items receiving a disproportionate share of attention from users. Predicting which newly-submitted items ...
Kristina Lerman, Tad Hogg
USITS
2003
15 years 1 months ago
Model-Based Resource Provisioning in a Web Service Utility
Internet service utilities host multiple server applications on a shared server cluster. A key challenge for these systems is to provision shared resources on demand to meet servi...
Ronald P. Doyle, Jeffrey S. Chase, Omer M. Asad, W...
SAINT
2007
IEEE
15 years 6 months ago
Data Management on Grid Filesystem for Data-Intensive Computing
In parallel computing environments such as HPC clusters and the Grid, data-intensive applications involve large overhead costs due to a concentration of access to the files on co...
Hitoshi Sato, Satoshi Matsuoka