4047 search results - page 167 / 810 » The Discrete Basis Problem |
111
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
120
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
140
click to vote
EMMCVPR
2001
Springer
15 years 7 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
131
click to vote
AMC
2007
15 years 2 months ago
2007
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Becaus...
105
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...