1477 search results - page 87 / 296 » Pattern Matching with Swaps |
111
click to vote
PR
2006
2006
Correspondence matching using kernel principal components analysis and label consistency constraints
15 years 2 months ago
This paper investigates spectral approaches to the problem of point pattern matching. We make two contributions. First, we consider rigid point-set alignment. Here we show how ker...
116
click to vote
FPL
2003
Springer
15 years 7 months ago
2003
Springer
Intrusion Detection Systems such as Snort scan incoming packets for evidence of security threats. The most computation-intensive part of these systems is a text search against hund...
112
click to vote
ICML
2008
IEEE
16 years 3 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...
104
click to vote
SPIRE
2009
Springer
15 years 8 months ago
2009
Springer
Given a pattern p over an alphabet Σp and a text t over an alphabet Σt, we consider the problem of determining a mapping f from Σp to Σ+ t such that t = f(p1)f(p2) . . . f(pm)....
128
click to vote
ICN
2005
Springer
15 years 7 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...