Sciweavers

995 search results - page 61 / 199
» String Pattern Discovery
Sort
View
SPIRE
2005
Springer
14 years 1 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
14 years 19 days ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
LATA
2009
Springer
14 years 2 months ago
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
IJWET
2007
91views more  IJWET 2007»
13 years 7 months ago
Performance tuning and cost discovery of mobile web-based applications
: When considering the addition of a mobile presentation channel to an existing web-based application, project managers should know how the mobile channel’s characteristics will ...
Matthias Book, Volker Gruhn, Malte Hülder, An...
ICWS
2003
IEEE
13 years 9 months ago
Cooperative Discovery for User-Centered Web Service Provisioning
In this paper we present means of personalization for user-centered Web services provisioning. We focus on the different phases of interaction with services and show how a coopera...
Wolf-Tilo Balke, Matthias Wagner