Sciweavers

725 search results - page 17 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
82
Voted
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
15 years 10 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
EMMCVPR
2011
Springer
13 years 9 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
ECIR
2007
Springer
14 years 11 months ago
A Study of Global Inference Algorithms in Multi-document Summarization
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...
Ryan T. McDonald
FOCS
2006
IEEE
15 years 3 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
COMGEO
1999
ACM
14 years 9 months ago
Point labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff