Sciweavers

1392 search results - page 165 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
SIAMCOMP
1998
85views more  SIAMCOMP 1998»
14 years 9 months ago
Separator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
FASE
2010
Springer
15 years 1 months ago
Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
Hermann Lehner, Peter Müller
WSC
2007
15 years 5 days ago
A test implementation of the core manufacturing simulation data specification
This paper describes an effort of testing the Core Manufacturing Simulation Data (CMSD) information model as a neutral data interface for a discrete event simulation model develop...
Marcus Johansson, Björn Johansson, Anders Sko...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
15 years 10 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
ESOP
2006
Springer
15 years 1 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner