Sciweavers

4208 search results - page 33 / 842
» Better Selection of the Best
Sort
View
DAIS
2009
14 years 1 days ago
Foraging for Better Deployment of Replicated Service Components
Abstract. Our work focuses on distributed software services and their requirements in terms of system performance and dependability. We target the problem of finding optimal deploy...
Máté J. Csorba, Hein Meling, Poul E....
WECWIS
2006
IEEE
161views ECommerce» more  WECWIS 2006»
14 years 5 months ago
Better control on recommender systems
In the context of electronic commerce, recommender systems enable merchants to assist customers in finding available products that will best satisfy their need. However, a recomm...
Esma Aïmeur, Flavien Serge Mani Onana
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
14 years 2 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 11 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
PAKDD
2010
ACM
198views Data Mining» more  PAKDD 2010»
14 years 3 months ago
A Better Strategy of Discovering Link-Pattern Based Communities by Classical Clustering Methods
Abstract. The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was pr...
Chen-Yi Lin, Jia-Ling Koh, Arbee L. P. Chen