1871 search results - page 158 / 375 » The Ephemeral Pairing Problem |
170
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
163
click to vote
ECCV
2006
Springer
15 years 10 months ago
2006
Springer
Common problem encountered in the analysis of dynamic scene is the problem of simultaneous estimation of the number of models and their parameters. This problem becomes difficult a...
159
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
142
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
191
click to vote
ALENEX
2009
15 years 7 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...