Sciweavers

ICFP
2012
ACM
13 years 6 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
183
Voted
ICFP
2012
ACM
13 years 6 months ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook
ICFP
2012
ACM
13 years 6 months ago
Shake before building: replacing make with haskell
Most complex software projects are compiled using a build tool (e.g. make), which runs commands in an order satisfying userdefined dependencies. Unfortunately, most build tools r...
Neil Mitchell
ICFP
2012
ACM
13 years 6 months ago
Addressing covert termination and timing channels in concurrent information flow systems
When termination of a program is observable by an adversary, confidential information may be leaked by terminating accordingly. While this termination covert channel has limited ...
Deian Stefan, Alejandro Russo, Pablo Buiras, Amit ...
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 6 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
13 years 6 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...
179
Voted
SDM
2012
SIAM
278views Data Mining» more  SDM 2012»
13 years 6 months ago
Legislative Prediction via Random Walks over a Heterogeneous Graph
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
Jun Wang, Kush R. Varshney, Aleksandra Mojsilovic
SDM
2012
SIAM
289views Data Mining» more  SDM 2012»
13 years 6 months ago
Mining Compressing Sequential Patterns
Compression based pattern mining has been successfully applied to many data mining tasks. We propose an approach based on the minimum description length principle to extract seque...
Hoang Thanh Lam, Fabian Moerchen, Dmitriy Fradkin,...
SDM
2012
SIAM
293views Data Mining» more  SDM 2012»
13 years 6 months ago
RP-growth: Top-k Mining of Relevant Patterns with Minimum Support Raising
One practical inconvenience in frequent pattern mining is that it often yields a flood of common or uninformative patterns, and thus we should carefully adjust the minimum suppor...
Yoshitaka Kameya, Taisuke Sato
SDM
2012
SIAM
322views Data Mining» more  SDM 2012»
13 years 6 months ago
Adaptive Multi-task Sparse Learning with an Application to fMRI Study
In this paper, we consider the multi-task sparse learning problem under the assumption that the dimensionality diverges with the sample size. The traditional l1/l2 multi-task lass...
Xi Chen, Jingrui He, Rick Lawrence, Jaime G. Carbo...