Sciweavers

7758 search results - page 82 / 1552
» On the Number of Distributive Lattices
Sort
View
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
14 years 11 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
ICALP
2001
Springer
14 years 2 months ago
Combinatorics of Periods in Strings
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
Eric Rivals, Sven Rahmann
ICPR
2010
IEEE
14 years 2 months ago
Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
Jerome Revaud, Guillaume Lavoue, Yasuo Ariki, Atil...
COCOON
1999
Springer
14 years 2 months ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
AMTA
1998
Springer
14 years 2 months ago
A Modular Approach to Spoken Language Translation for Large Domains
The MT engine of the Janus speech-to-speech translation system is designed around four main principles: 1 an interlingua approach that allows the e cient addition of new languages,...
Monika Woszczyna, Matthew Broadhead, Donna Gates, ...