Sciweavers

1290 search results - page 45 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
DAC
2005
ACM
16 years 5 months ago
Structure preserving reduction of frequency-dependent interconnect
A rational Arnoldi method for passivity-preserving model-order reduction (MOR) with implicit multi-point moment matching for systems with frequency-dependent interconnects is desc...
Quming Zhou, Kartik Mohanram, Athanasios C. Antoul...
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 8 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
DAM
2011
14 years 11 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
ECCV
2002
Springer
16 years 6 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
COMPGEOM
2008
ACM
15 years 6 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri