2027 search results - page 80 / 406 » Approximating power indices |
DAM
2006
14 years 12 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
IPMU
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
100
click to vote
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
ALT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...