Sciweavers

2570 search results - page 195 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICCSA
2004
Springer
15 years 9 months ago
Packing: Scheduling, Embedding, and Approximating Metrics
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
Hu Zhang

Publication
191views
17 years 2 months ago
ERICA Switch Algorithm: A Complete Description
The ERICA switch algorithm has been discussed extensively in TM group in the past. However, over the last two years, the algorithm has been substantially modified. This contributio...
Raj Jain, Shiv Kalyanaraman, Rohit, Goyal, Sonia F...
SAC
2006
ACM
15 years 10 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
BPM
2009
Springer
138views Business» more  BPM 2009»
15 years 11 months ago
Graph Matching Algorithms for Business Process Model Similarity Search
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
NDSS
1998
IEEE
15 years 8 months ago
Distributed Algorithms for Attack Localization in All-Optical Networks
All-Optical Networks provide ultra-fast data rates, but present a new set of challenges for network security. We present a new algorithm for attack localization in networks. The a...
Ruth Bergman, Muriel Médard, Serena Chan