Sciweavers

3653 search results - page 76 / 731
» Learning of Partial Languages
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 6 months ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
Gagan Goel, Chinmay Karande, Lei Wang
POPL
2001
ACM
16 years 6 months ago
Colored local type inference
We present a type system for a language based on F, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination o...
Martin Odersky, Christoph Zenger, Matthias Zenger
DAM
2011
15 years 1 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
MST
2000
86views more  MST 2000»
15 years 6 months ago
Team Learning of Computable Languages
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined s...
Sanjay Jain, Arun Sharma
ALT
2006
Springer
16 years 3 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri