Sciweavers

279 search results - page 7 / 56
» A Name Abstraction Functor for Named Sets
Sort
View
VMCAI
2007
Springer
14 years 2 months ago
Constructing Specialized Shape Analyses for Uniform Change
Abstract. This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express ...
Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W....
PKDD
2000
Springer
159views Data Mining» more  PKDD 2000»
14 years 8 days ago
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
ICDE
2005
IEEE
115views Database» more  ICDE 2005»
14 years 2 months ago
Provenance-Aware Sensor Data Storage
Abstract— Sensor network data has both historical and realtime value. Making historical sensor data useful, in particular, requires storage, naming, and indexing. Sensor data pre...
Jonathan Ledlie, Chaki Ng, David A. Holland
AIMSA
2006
Springer
14 years 13 days ago
A Formal General Setting for Dialogue Protocols
Abstract. In this paper, we propose a general and abstract formal setting for argumentative dialogue protocols. We identify a minimal set of basic parameters that characterize dial...
Leila Amgoud, Sihem Belabbes, Henri Prade
TPHOL
2005
IEEE
14 years 2 months ago
Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
Michael Norrish, Konrad Slind