876 search results - page 108 / 176 » A theory of learning with similarity functions |
135
Voted
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We introduce a novel framework for nonrigid feature
matching among multiple sets in a way that takes into consideration
both the feature descriptor and the features spatial
arra...
125
click to vote
ESWS
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. This research explores a new method for Semantic Web service matchmaking based on iSPARQL strategies, which enables to query the Semantic Web with techniques from traditi...
106
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
100
click to vote
PVLDB
2010
15 years 1 days ago
2010
Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of ...
108
click to vote
AAAI
2006
15 years 3 months ago
2006
Composing existing Web services to deliver new functionality is a difficult problem as it involves resolving semantic, syntactic and structural differences among the interfaces of...