934 search results - page 10 / 187 » A theoretical analysis of the HIFF problem |
CORR
2012
Springer
13 years 5 months ago
2012
Springer
This paper examines the problem of learning with a finite and possibly large set of p base kernels. It presents a theoretical and empirical analysis of an approach addressing thi...
MFCS
1994
Springer
15 years 1 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
117
click to vote
PKDD
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Analysis of privacy-sensitive data in a multi-party environment often assumes that the parties are well-behaved and they abide by the protocols. Parties compute whatever ...
COR
2006
14 years 9 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
JALC
2006
14 years 9 months ago
2006
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...