4498 search results - page 139 / 900 » How to Invent Functions |
CPM
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...
FPCA
1989
14 years 2 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the searc...
JMLR
2006
13 years 10 months ago
2006
We introduce an algorithm that simultaneously estimates a classification function as well as its gradient in the supervised learning framework. The motivation for the algorithm is...
LICS
2012
IEEE
12 years 19 days ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...