1272 search results - page 76 / 255 » Approximate Parameterized Matching |
ICAIL
2003
ACM
15 years 4 months ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
136
click to vote
PAMI
2012
13 years 1 months ago
2012
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
IJCNN
2000
IEEE
15 years 3 months ago
2000
IEEE
The choice of transfer functions may strongly influence complexity and performance of neural networks used in classification and approximation tasks. A taxonomy of activation an...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
UAI
2001
15 years 19 days ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...