Sciweavers

6142 search results - page 496 / 1229
» The Complexity of Partition Functions
Sort
View
ECAI
2010
Springer
15 years 8 months ago
Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities
Abstract. Until recently, computational aspects of the Shapley value were only studied under the assumption that there are no externalities from coalition formation, i.e., that the...
Tomasz P. Michalak, Talal Rahwan, Dorota Marciniak...
SIGCOMM
2010
ACM
15 years 7 months ago
Scalable flow-based networking with DIFANE
Ideally, enterprise administrators could specify fine-grain policies that drive how the underlying switches forward, drop, and measure traffic. However, existing techniques for fl...
Minlan Yu, Jennifer Rexford, Michael J. Freedman, ...
ECCV
2010
Springer
15 years 7 months ago
Superpixels and Supervoxels in an Energy Optimization Framework
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
Olga Veksler, Yuri Boykov, Paria Mehrani
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 7 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
DCG
2010
171views more  DCG 2010»
15 years 7 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...