Sciweavers

1018 search results - page 110 / 204
» Generative unbinding of names
Sort
View
WWW
2005
ACM
14 years 10 months ago
Gimme' the context: context-driven automatic semantic annotation with C-PANKOW
Without the proliferation of formal semantic annotations, the Semantic Web is certainly doomed to failure. In earlier work we presented a new paradigm to avoid this: the 'Sel...
Günter Ladwig, Philipp Cimiano, Steffen Staab
KDD
2009
ACM
200views Data Mining» more  KDD 2009»
14 years 4 months ago
Visual analysis of documents with semantic graphs
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
Delia Rusu, Blaz Fortuna, Dunja Mladenic, Marko Gr...
ASM
2010
ASM
14 years 3 months ago
Using Event-B to Verify the Kmelia Components and Their Assemblies
and formal model, named Kmelia [1,2], with an associated language to specify components, their provided and required services and their assemblies; we also developed a framework na...
Pascal André, Gilles Ardourel, Christian At...
LACL
2005
Springer
14 years 2 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
ASIACRYPT
2006
Springer
14 years 29 days ago
On the (In)security of Stream Ciphers Based on Arrays and Modular Addition
Abstract. Stream ciphers play an important role in symmetric cryptology because of their suitability in high speed applications where block ciphers fall short. A large number of fa...
Souradyuti Paul, Bart Preneel