2137 search results - page 317 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
140
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
183
Voted
VLSM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
136
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
158
click to vote
IJAR
2010
15 years 3 months ago
2010
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
158
click to vote
WSDM
2009
ACM
15 years 11 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...