Sciweavers

3816 search results - page 195 / 764
» Characteristic relational patterns
Sort
View
ACTA
2007
85views more  ACTA 2007»
15 years 6 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
FSE
1994
Springer
134views Cryptology» more  FSE 1994»
15 years 10 months ago
Cryptanalysis of McGuffin
This paper shows that the actual proposal for an unbalanced Feistel network by Schneier and Blaze is as vulnerable to differential cryptanalysis as the DES. 1 McGuffin Schneier and...
Vincent Rijmen, Bart Preneel
226
Voted
IDEAS
1999
IEEE
166views Database» more  IDEAS 1999»
15 years 10 months ago
Recovery Protocols in Multi-Agent Probabilistic Reasoning Systems
In this paper, we introduce a probabilistic relational data model as the basis for developing multi-agent probabilistic reasoning systems. Since our model subsumes the traditional...
Cory J. Butz, S. K. Michael Wong
ICPR
2006
IEEE
16 years 7 months ago
The Hidden Birth Dates of Personalities of Genesis
Witztum, Rips and Rosenberg [4] have shown that when the Book of Genesis is written as two-dimensional arrays with the topology of a cylinder, equidistant letter sequences spellin...
Doron Witztum
168
Voted
ACL
2003
15 years 7 months ago
Offline Strategies for Online Question Answering: Answering Questions Before They Are Asked
Recent work in Question Answering has focused on web-based systems that extract answers using simple lexicosyntactic patterns. We present an alternative strategy in which patterns...
Michael Fleischman, Eduard H. Hovy, Abdessamad Ech...