Sciweavers

8437 search results - page 678 / 1688
» Preferences over Sets
Sort
View
MCS
2000
Springer
15 years 11 months ago
Ensemble Methods in Machine Learning
Ensemble methods are learning algorithms that construct a set of classi ers and then classify new data points by taking a (weighted) vote of their predictions. The original ensembl...
Thomas G. Dietterich
FLAIRS
2007
15 years 9 months ago
Learning Paraphrases from WNS Corpora
Paraphrase detection can be seen as the task of aligning sentences that convey the same information but yet are written in different forms. Such resources are important to automat...
João Cordeiro, Gaël Dias, Pavel Brazdi...
APN
2008
Springer
15 years 9 months ago
Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study
Abstract. Web services represent a promising technology for the development of distributed heterogeneous software systems. In this setting, a major issue is to establish whether tw...
Filippo Bonchi, Antonio Brogi, Sara Corfini, Fabio...
CIE
2008
Springer
15 years 9 months ago
Perfect Local Computability and Computable Simulations
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
Russell Miller, Dustin Mulcahey
COCO
2008
Springer
74views Algorithms» more  COCO 2008»
15 years 9 months ago
Approximation Resistant Predicates from Pairwise Independence
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
Per Austrin, Elchanan Mossel