Sciweavers

5607 search results - page 797 / 1122
» Graph structure in the Web
Sort
View
CP
2007
Springer
15 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 10 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
CAV
2006
Springer
116views Hardware» more  CAV 2006»
15 years 10 months ago
Lazy Shape Analysis
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...
LREC
2010
184views Education» more  LREC 2010»
15 years 8 months ago
New Features in Spoken Language Search Hawk (SpLaSH): Query Language and Query Sequence
In this work we present further development of the SpLaSH (Spoken Language Search Hawk) project. SpLaSH implements a data model for annotated speech corpora integrated with textua...
Sara Romano, Francesco Cutugno
AI
2007
Springer
15 years 7 months ago
The Carneades model of argument and burden of proof
We present a formal, mathematical model of argument structure and evaluation, taking seriously the procedural and dialogical aspects of argumentation. The model applies proof stan...
Thomas F. Gordon, Henry Prakken, Douglas Walton