1274 search results - page 132 / 255 » The Geometry of Coin-Weighing Problems |
115
Voted
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
We present a very simple and effective method for eliminating the degeneracy inherent in a planar scene, and demonstrate its performance in a useful application -- that of binocul...
104
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
The success of kernel methods including support vector machines (SVMs) strongly depends on the design of appropriate kernels. While initially kernels were designed in order to han...
133
Voted
CPM
2009
Springer
15 years 7 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
100
click to vote
CPM
2009
Springer
15 years 7 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...