Sciweavers

235 search results - page 19 / 47
» Studying Teamwork in Global IT Support
Sort
View
ICPP
2000
IEEE
15 years 2 months ago
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an ...
Jie Wu
ESEC
1997
Springer
15 years 1 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
93
Voted
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
15 years 1 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
60
Voted
PVLDB
2008
77views more  PVLDB 2008»
14 years 9 months ago
Efficient network aware search in collaborative tagging sites
The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network o...
Sihem Amer-Yahia, Michael Benedikt, Laks V. S. Lak...
ICTAI
2007
IEEE
15 years 4 months ago
A Probabilistic Substructure-Based Approach for Graph Classification
The classification of graph based objects is an important challenge from a knowledge discovery standpoint and has attracted considerable attention recently. In this paper, we pres...
H. D. K. Moonesinghe, Hamed Valizadegan, Samah Jam...