Sciweavers

1438 search results - page 91 / 288
» An Expressive Extension of TLC
Sort
View
108
Voted
DLOG
2011
14 years 4 months ago
Practical Epistemic Entailment Checking in SROIQ
In this paper, we present a reasoner capable of epistemic inferences in SROIQ knowledge bases. We first identify some counter intuitive effects of imposing the traditional semant...
Anees Mehdi, Sebastian Rudolph
ECOOP
2011
Springer
14 years 16 days ago
Verifying Multi-object Invariants with Relationships
Relationships capture the interplay between classes in object-oriented programs, and various extensions of object-oriented programming languages allow the programmer to explicitly ...
Stephanie Balzer, Thomas R. Gross

Publication
197views
13 years 8 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
PLPV
2012
ACM
13 years 8 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey
200
Voted
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 7 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...