1830 search results - page 13 / 366 » Functional Programs as Linked Data |
105
click to vote
ECML
2007
Springer
15 years 5 months ago
2007
Springer
Many data mining techniques are these days in use for ontology learning – text mining, Web mining, graph mining, link analysis, relational data mining, and so on. In the current ...
134
click to vote
AMAST
2006
Springer
15 years 3 months ago
2006
Springer
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
SAS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
CIKM
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
ASWEC
2004
IEEE
15 years 3 months ago
2004
IEEE
"Totally Functional Programming" (TFP) advocates the complete replacement of symbolic representations for data by functions. TFP is motivated by observations from practi...