Sciweavers

1096 search results - page 93 / 220
» Evaluating Algorithms for Concept Description
Sort
View
AUSAI
2009
Springer
14 years 3 months ago
A Graph Distance Based Structural Clustering Approach for Networks
In the era of information explosion, structured data emerge on a large scale. As a description of structured data, network has drawn attention of researchers in many subjects. Netw...
Xin Su, Chunping Li
AINA
2010
IEEE
14 years 5 days ago
YASA-M: A Semantic Web Service Matchmaker
Abstract--In this paper, we present new algorithms for matching Web services described in YASA4WSDL (YASA for short). We have already defined YASA that overcomes some issues missin...
Yassin Chabeb, Samir Tata, Alain Ozanne
INFOCOM
1999
IEEE
14 years 1 months ago
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
R. Sriram, G. Manimaran, C. Siva Ram Murthy
CIKM
2001
Springer
14 years 15 days ago
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining
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...
Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen
IJHPCA
2010
105views more  IJHPCA 2010»
13 years 7 months ago
A Pipelined Algorithm for Large, Irregular All-Gather Problems
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
Jesper Larsson Träff, Andreas Ripke, Christia...