1871 search results - page 56 / 375 » The Ephemeral Pairing Problem |
117
click to vote
SAC
2011
ACM
14 years 2 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
127
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
We propose an algorithm that simultaneously extracts
disparities and alpha matting information given a stereo
image pair. Our method divides the reference image into
a set of ov...
RECOMB
2005
Springer
15 years 11 months ago
2005
Springer
We develop an iterative relaxation algorithm, called RIBRA, for NMR protein backbone assignment. RIBRA applies nearest neighbor and weighted maximum independent set algorithms to ...
CLEANDB
2006
ACM
15 years 5 months ago
2006
ACM
We propose the Multiple Join Path (MJP) framework for obtaining high quality information by linking fields across multiple databases, when the underlying databases have poor qual...
STACS
2001
Springer
15 years 3 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...