Sciweavers

262 search results - page 8 / 53
» Approximating the 2-Interval Pattern Problem
Sort
View
SSPR
2000
Springer
14 years 1 months ago
A New Approximation Method of the Quadratic Discriminant Function
Abstract. For many statistical pattern recognition methods, distributions of sample vectors are assumed to be normal, and the quadratic discriminant function derived from the proba...
Shinichiro Omachi, Fang Sun, Hirotomo Aso
DAC
2011
ACM
12 years 9 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
CCCG
2008
13 years 11 months ago
The Embroidery Problem
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
Esther M. Arkin, George Hart, Joondong Kim, Irina ...
JMLR
2010
125views more  JMLR 2010»
13 years 4 months ago
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
Jacek P. Dmochowski, Paul Sajda, Lucas C. Parra
RSA
2002
73views more  RSA 2002»
13 years 9 months ago
New and faster filters for multiple approximate string matching
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Ricardo A. Baeza-Yates, Gonzalo Navarro