LATIN
2010
Springer
14 years 10 days ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
CLEF
2001
Springer
14 years 11 days ago
2001
Springer
CIKM
2001
Springer
14 years 11 days ago
2001
Springer
CIKM
2001
Springer
14 years 11 days ago
2001
Springer
Scalable data mining in large databases is one of today's challenges to database technologies. Thus, substantial effort is dedicated to a tight coupling of database and data ...
CIKM
2001
Springer
14 years 11 days ago
2001
Springer
CIKM
2001
Springer
14 years 11 days ago
2001
Springer
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...
CIKM
2001
Springer
14 years 11 days ago
2001
Springer
CAISE
2003
Springer
14 years 11 days ago
2003
Springer
This paper presents an approach for the improvement of the efficiency of the performance analysis of large workflow models. We propose a simple and powerful decidable Petri net red...
CAISE
2003
Springer
14 years 11 days ago
2003
Springer
We present our work on composing mobile Web services, denoted by M-services, in the wireless world. The wireless world has its own features that make it completely different from t...
CAISE
2003
Springer
14 years 11 days ago
2003
Springer
The paper discusses the focus of Requirements Engineering in workflow application development. Its core thesis is that the workflow application and the new business process it supp...