Sciweavers

770 search results - page 56 / 154
» Toward an Optimal Redundancy Strategy for Distributed Comput...
Sort
View
ICTIR
2009
Springer
13 years 5 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
PODC
1998
ACM
14 years 3 days ago
Amortizing Randomness in Private Multiparty Computations
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
DCOSS
2005
Springer
14 years 1 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
IPPS
2006
IEEE
14 years 1 months ago
Multisite co-allocation algorithms for computational grid
Efficient multisite job scheduling facilitates the cooperation of multi-domain massively parallel processor systems in a computing grid environment. However, co-allocation, hetero...
Weizhe Zhang, A. M. K. Cheng, Mingzeng Hu
NOMS
2008
IEEE
132views Communications» more  NOMS 2008»
14 years 2 months ago
Improving distributed service management using Service Modeling Language (SML)
—Automatic service and application deployment and management is becoming possible through the use of service and infrastructure discovery and policy systems. But using the infras...
Robert Adams, Ricardo Rivaldo, Guilherme Germoglio...