196 search results - page 18 / 40 » A finite set of functions with an EXPTIME-complete compositi... |
89
Voted
AAAI
2006
15 years 1 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...
103
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
STOC
2005
ACM
15 years 12 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
RAM
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
106
Voted
JMLR
2010
14 years 6 months ago
2010
Appropriate selection of the kernel function, which implicitly defines the feature space of an algorithm, has a crucial role in the success of kernel methods. In this paper, we co...