Sciweavers

114 search results - page 9 / 23
» Engineering Algorithms for Approximate Weighted Matching
Sort
View
96
Voted
IMC
2006
ACM
15 years 5 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
93
Voted
ML
2002
ACM
146views Machine Learning» more  ML 2002»
14 years 11 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
94
Voted
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 6 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
PAMI
2006
168views more  PAMI 2006»
14 years 11 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...
68
Voted
ECIR
2004
Springer
15 years 1 months ago
Fault-Tolerant Fulltext Information Retrieval in Digital Multilingual Encyclopedias with Weighted Pattern Morphing
This paper introduces a new approach to add fault-tolerance to a fulltext retrieval system. The weighted pattern morphing technique circumvents some of the disadvantages of the wid...
Wolfram M. Esser