562 search results - page 54 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
SOFSEM
2007
Springer
14 years 2 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
SODA
2007
ACM
13 years 9 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
We introduce a fast, multiscale algorithm for image segmentation. Our algorithm uses modern numeric techniques to nd an approximate solution to normalized cut measures in time tha...