Sciweavers

2113 search results - page 214 / 423
» Learning Multi-modal Similarity
Sort
View
ESWS
2008
Springer
15 years 7 months ago
The Creation and Evaluation of iSPARQL Strategies for Matchmaking
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...
Christoph Kiefer, Abraham Bernstein
EWCBR
2008
Springer
15 years 7 months ago
ColibriCook: A CBR System for Ontology-Based Recipe Retrieval and Adaptation
In this paper we present ColibriCook: a CBR system for ontology-based cooking recipe retrieval and adaptation. The system's purpose is to participate in the 1st Computer Cooki...
Juan DeMiguel, Laura Plaza, Belén Dí...
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 7 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
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-...
Kenneth L. Clarkson
SWAP
2008
15 years 7 months ago
Combining Statistical Techniques and Lexico-syntactic Patterns for Semantic Relations Extraction from Text
We describe here a methodology to combine two different techniques for Semantic Relation Extraction from texts. On the one hand, generic lexicosyntactic patterns are applied to the...
Emiliano Giovannetti, Simone Marchi, Simonetta Mon...
NIPS
2004
15 years 7 months ago
Mistake Bounds for Maximum Entropy Discrimination
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
Philip M. Long, Xinyu Wu