428 search results - page 61 / 86 » Completeness of a Fact Extractor |
123
click to vote
TKDE
2012
13 years 2 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
102
click to vote
WWW
2004
ACM
16 years 14 days ago
2004
ACM
The emerging standards for the publication of Web Services are focused on the specification of the static interfaces of the operations to be invoked, or on the service composition...
JELIA
2004
Springer
15 years 5 months ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
104
click to vote
CRYPTO
2001
Springer
15 years 4 months ago
2001
Springer
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
EUROCOLT
1999
Springer
15 years 4 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...