Sciweavers

4930 search results - page 797 / 986
» Learning minimal abstractions
Sort
View
CLOUDCOM
2010
Springer
15 years 4 months ago
Cost-Optimal Outsourcing of Applications into the Clouds
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...
Immanuel Trummer, Frank Leymann, Ralph Mietzner, W...
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
15 years 4 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
ICTAI
2010
IEEE
15 years 4 months ago
Revision Rules in the Theory of Evidence
Abstract--Combination rules proposed so far in the DempsterShafer theory of evidence, especially Dempster rule, rely on a basic assumption, that is, pieces of evidence being combin...
Jianbing Ma, Weiru Liu, Didier Dubois, Henri Prade
INFOCOM
2010
IEEE
15 years 4 months ago
Distributed Dynamic Speed Scaling
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
Rade Stanojevic, Robert Shorten
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie