Sciweavers

1700 search results - page 100 / 340
» Combinatorial Pattern Matching
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
KAIS
2006
87views more  KAIS 2006»
13 years 10 months ago
Improving the performance of 1D object classification by using the Electoral College
Abstract It has been proven that districted matching schemes (e.g., the US presidential election scheme, also called the Electoral College) are more stable than undistricted matchi...
Liang Chen, Ruoyu Chen, Sharmin Nilufar
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
14 years 10 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
BIRD
2008
Springer
221views Bioinformatics» more  BIRD 2008»
13 years 12 months ago
Comparison of Exact String Matching Algorithms for Biological Sequences
Exact matching of single patterns in DNA and amino acid sequences is studied. We performed an extensive experimental comparison of algorithms presented in the literature. In additi...
Petri Kalsi, Hannu Peltola, Jorma Tarhio
CORR
2008
Springer
69views Education» more  CORR 2008»
13 years 10 months ago
Solving Time of Least Square Systems in Sigma-Pi Unit Networks
The solving of least square systems is a useful operation in neurocomputational modeling of learning, pattern matching, and pattern recognition. In these last two cases, the soluti...
Pierre Courrieu