Sciweavers

RTA
2011
Springer
14 years 10 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
RSFDGRC
2011
Springer
255views Data Mining» more  RSFDGRC 2011»
14 years 10 months ago
Construction and Analysis of Web-Based Computer Science Information Networks
WINACS (Web-based Information Network Analysis for Computer Science) is a project that incorporates many recent, exciting developments in data sciences to construct a Web-based co...
Jiawei Han
RSFDGRC
2011
Springer
287views Data Mining» more  RSFDGRC 2011»
14 years 10 months ago
Towards Faster Estimation of Statistics and ODEs Under Interval, P-Box, and Fuzzy Uncertainty: From Interval Computations to Rou
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In interval comp...
Vladik Kreinovich
RSA
2011
106views more  RSA 2011»
14 years 10 months ago
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Luc Devroye, Svante Janson
REST
2011
ACM
14 years 10 months ago
REST and Linked Data: a match made for domain driven development?
At a first glance there might appear to be an obvious alignment and overlap between the approaches prescribed by REST and Linked Data. On more detailed inspection divergences in ...
Kevin R. Page, David De Roure, Kirk Martinez