Sciweavers

2889 search results - page 528 / 578
» Querying Structured Hyperdocuments
Sort
View
AAAI
2008
13 years 10 months ago
Lifted Probabilistic Inference with Counting Formulas
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
Brian Milch, Luke S. Zettlemoyer, Kristian Kerstin...
CRYPTO
2008
Springer
100views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
Abstract. This paper discusses key recovery and universal forgery attacks on several MAC algorithms based on universal hash functions. The attacks use a substantial number of verif...
Helena Handschuh, Bart Preneel
DAS
2008
Springer
13 years 9 months ago
A Comparison of Clustering Methods for Word Image Indexing
In this paper we explore the effectiveness of three clustering methods used to perform word image indexing. The three methods are: the Self-Organazing Map (SOM), the Growing Hiera...
Simone Marinai, Emanuele Marino, Giovanni Soda
EWCBR
2008
Springer
13 years 9 months ago
Back to the Future: Knowledge Light Case Base Cookery
The domain of cookery has been of interest for Case-Based Reasoning (CBR) research for many years since the CHEF case-based planning system in the mid 1980s. This paper returns to ...
Qian Zhang, Rong Hu, Brian Mac Namee, Sarah Jane D...
ACL
2007
13 years 9 months ago
Randomised Language Modelling for Statistical Machine Translation
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
David Talbot, Miles Osborne