562 search results - page 28 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
TCBB
2010
13 years 6 months ago
2010
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
CPM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
TCC
2012
Springer
12 years 3 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...