Sciweavers

979 search results - page 123 / 196
» Presentations for Abstract Context Institutions
Sort
View
SIGSOFT
2004
ACM
14 years 8 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
WWW
2008
ACM
14 years 8 months ago
Computable social patterns from sparse sensor data
We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...
Dinh Q. Phung, Brett Adams, Svetha Venkatesh
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
VMCAI
2009
Springer
14 years 2 months ago
Reducing Behavioural to Structural Properties of Programs with Procedures
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
Dilian Gurov, Marieke Huisman
ADBIS
2009
Springer
128views Database» more  ADBIS 2009»
14 years 2 months ago
Detecting Moving Objects in Noisy Radar Data Using a Relational Database
Abstract. In moving object databases, many authors assume that number and position of objects to be processed are always known in advance. Detecting an unknown moving object and pu...
Andreas Behrend, Rainer Manthey, Gereon Schül...