Sciweavers

2356 search results - page 231 / 472
» Characterizations of postman sets
Sort
View
ACL
2008
15 years 8 months ago
A Logical Basis for the D Combinator and Normal Form in CCG
The standard set of rules defined in Combinatory Categorial Grammar (CCG) fails to provide satisfactory analyses for a number of syntactic structures found in natural languages. T...
Frederick Hoyt, Jason Baldridge
SPLC
2010
15 years 8 months ago
Feature-to-Code Mapping in Two Large Product Lines
Abstract. Large product lines have complex build systems, which obscure mapping of features to code. We extract this mapping out of the build systems of two operating systems kerne...
Thorsten Berger, Steven She, Rafael Lotufo, Krzysz...
126
Voted
NIPS
2008
15 years 8 months ago
Algorithms for Infinitely Many-Armed Bandits
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
Yizao Wang, Jean-Yves Audibert, Rémi Munos
SEBD
2008
127views Database» more  SEBD 2008»
15 years 8 months ago
Service-oriented Semantic Collaboration in Distributed Information Systems
Collaborative information systems in a P2P scenario are characterized by a set of independent peers that dynamically need to cooperate by sharing data and services. For effective c...
Devis Bianchini, Valeria De Antonellis, Michele Me...
NIPS
2007
15 years 8 months ago
A general agnostic active learning algorithm
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
Sanjoy Dasgupta, Daniel Hsu, Claire Monteleoni