3641 search results - page 309 / 729 » On Computability of Pattern Recognition Problems |
188
Voted
MCS
2007
Springer
15 years 7 months ago
2007
Springer
We model ferromagnetic effects by using reduced scalar potential. An overlapping domain-decomposition technique is proposed to solve the underlying problem in unbounded domain. I...
217
click to vote
ISCAS
1994
IEEE
15 years 11 months ago
1994
IEEE
Stochastic computation uses pulse streams to represent numbers. In this paper, we have studied the novel method to implement the number system which uses the ratio of the number o...
147
Voted
SODA
2000
ACM
15 years 8 months ago
2000
ACM
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
214
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
In a variety of applications, kernel machines such as Support Vector Machines (SVMs) have been used with great success often delivering stateof-the-art results. Using the kernel t...
201
click to vote
PKC
2010
Springer
15 years 9 months ago
2010
Springer
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...