1515 search results - page 49 / 303 » On the relation of aspects and monads |
163
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
164
click to vote
SPEECH
2008
15 years 6 months ago
2008
Evaluation of spoken dialogue systems has been traditionally carried out in terms of instrumentally or expert-derived measures (usually called ``objective" evaluation) and qu...
189
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
180
click to vote
TPHOL
2008
IEEE
16 years 16 days ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
174
click to vote
TLCA
2007
Springer
16 years 8 days ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...