86 search results - page 16 / 18 » Worst-Case Running Times for Average-Case Algorithms |
OOPSLA
2010
Springer
13 years 7 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
CPM
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
ECML
2006
Springer
14 years 6 days ago
2006
Springer
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
CSB
2005
IEEE
14 years 2 months ago
2005
IEEE
Our paper describes the first provably-efficient algorithm for determining protein structures de novo, solely from experimental data. We show how the global nature of a certain ...
ASAP
2002
IEEE
14 years 1 months ago
2002
IEEE
The determinism of instruction cache performance can be considered a major problem in multi-media devices which hope to maximise their quality of service. If instructions are evic...