1452 search results - page 144 / 291 » Algorithmic Analysis of Array-Accessing Programs |
103
Voted
AAAI
1994
15 years 1 months ago
1994
The availability of large on-line text corpora provides a natural and promising bridge between the worlds of natural language processing (NLP) and machine learning (ML). In recent...
88
Voted
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
137
Voted
JMLR
2012
13 years 3 months ago
2012
We study the prevalent problem when a test distribution differs from the training distribution. We consider a setting where our training set consists of a small number of sample d...
101
click to vote
CORR
2010
Springer
15 years 21 days ago
2010
Springer
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
PLDI
2005
ACM
15 years 6 months ago
2005
ACM
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external...