Sciweavers

10542 search results - page 218 / 2109
» A General Notion of Useful Information
Sort
View
ESWS
2007
Springer
16 years 24 days ago
Scalable Web Service Composition with Partial Matches
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
Adina Sirbu, Jörg Hoffmann
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 10 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
CORR
2008
Springer
102views Education» more  CORR 2008»
15 years 6 months ago
Game Theory with Costly Computation
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
Joseph Y. Halpern, Rafael Pass
153
Voted
AI
2006
Springer
15 years 6 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
JMLR
2012
13 years 9 months ago
Algorithms for Learning Kernels Based on Centered Alignment
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh