Sciweavers

649 search results - page 75 / 130
» Comparative Evaluation of PL languages
Sort
View
ICFP
2009
ACM
14 years 11 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
ICML
2005
IEEE
14 years 11 months ago
Learning strategies for story comprehension: a reinforcement learning approach
This paper describes the use of machine learning to improve the performance of natural language question answering systems. We present a model for improving story comprehension th...
Eugene Grois, David C. Wilkins
PVM
2007
Springer
14 years 5 months ago
Parallelizing Dense Linear Algebra Operations with Task Queues in
llc is a language based on C where parallelism is expressed using compiler directives. The llc compiler produces MPI code which can be ported to both shared and distributed memory ...
Antonio J. Dorta, José M. Badía, Enr...
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 4 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
ECML
2005
Springer
14 years 4 months ago
Learning to Complete Sentences
Abstract. We consider the problem of predicting how a user will continue a given initial text fragment. Intuitively, our goal is to develop a “tab-complete” function for natura...
Steffen Bickel, Peter Haider, Tobias Scheffer