Sciweavers

264 search results - page 24 / 53
» Learning Linearly Separable Languages
Sort
View
JMLR
2012
11 years 11 months ago
UPAL: Unbiased Pool Based Active Learning
In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by minimizing the unbiased estimator of the risk of a hypothe...
Ravi Ganti, Alexander Gray
ESOP
2006
Springer
14 years 8 days ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker
IFIP
2000
Springer
14 years 6 days ago
PETSc and Overture: Lessons Learned Developing an Interface between Components
We consider two software packages that interact with each other as components: Overture and PETSc. An interface between these two packages could be of tremendous value to applicati...
Kristopher R. Buschelman, William Gropp, Lois C. M...
CC
2007
Springer
107views System Software» more  CC 2007»
14 years 2 months ago
A Fast Cutting-Plane Algorithm for Optimal Coalescing
Abstract. Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorith...
Daniel Grund, Sebastian Hack
NIPS
2001
13 years 10 months ago
Natural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
Dan Klein, Christopher D. Manning