4112 search results - page 281 / 823 » Efficient Algorithms for the Spoonerism Problem |
164
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
The problem of task assignment naturally arises in multiagent multitask systems, where an optimal matching of agents and tasks is sought. This problem is a combinatorial optimizati...
177
click to vote
JMLR
2010
15 years 1 months ago
2010
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
231
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
165
click to vote
TKDE
2008
15 years 6 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
166
click to vote
EMNLP
2010
15 years 4 months ago
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...