1382 search results - page 130 / 277 » Formal Analysis of Online Algorithms |
155
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
In a new model for answer retrieval, document collections are distilled offline into large repositories of facts. Each fact constitutes a potential direct answer to questions seek...
164
click to vote
DAS
2010
Springer
15 years 11 months ago
2010
Springer
Whole-book recognition is a document image analysis strategy that operates on the complete set of a book’s page images, attempting to improve accuracy by automatic unsupervised ...
226
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
182
click to vote
PLDI
1997
ACM
15 years 10 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
171
click to vote
NIPS
2003
15 years 7 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...