Sciweavers

199 search results - page 18 / 40
» On some Algorithmic Problems for Groups and Monoids
Sort
View
DAWAK
2006
Springer
13 years 11 months ago
Mining Direct Marketing Data by Ensembles of Weak Learners and Rough Set Methods
This paper describes problem of prediction that is based on direct marketing data coming from Nationwide Products and Services Questionnaire (NPSQ) prepared by Polish division of A...
Jerzy Blaszczynski, Krzysztof Dembczynski, Wojciec...
JCM
2007
76views more  JCM 2007»
13 years 7 months ago
Scheduling Small Packets in IPSec Multi-accelerator Based Systems
—IPSec is a suite of protocols that adds security to communications at the IP level. Protocols within the IPSec suite make extensive use of cryptographic algorithms. Since these ...
Antonio Vincenzo Taddeo, Alberto Ferrante, Vincenz...
SSD
2005
Springer
173views Database» more  SSD 2005»
14 years 1 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
ANTSW
2004
Springer
13 years 11 months ago
Mesh-Partitioning with the Multiple Ant-Colony Algorithm
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
Peter Korosec, Jurij Silc, Borut Robic
DIS
2009
Springer
14 years 2 months ago
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
Min-Soo Kim 0002, Jiawei Han