Sciweavers

671 search results - page 13 / 135
» Mean shift-based clustering
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Adaptive and dynamic intrusion detection by means of idiotypic networks paradigm
—In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDS), that aims at dealing with large scale network attacks featuring vari...
Marek Ostaszewski, Pascal Bouvry, Franciszek Sered...
ICCCN
2007
IEEE
13 years 7 months ago
Online Selection of Tracking Features using AdaBoost
In this paper, a novel feature selection algorithm for object tracking is proposed. This algorithm performs more robust than the previous works by taking the correlation between f...
Ying-Jia Yeh, Chiou-Ting Hsu
BIRTHDAY
2009
Springer
13 years 5 months ago
Management of UML Clusters
Abstract. Software engineering uses UML diagrams as a standard technique for specification and development of software. Various UML diagrams are used for specification of different...
Peggy Schmidt, Bernhard Thalheim
ICCV
2011
IEEE
12 years 7 months ago
Source Constrained Clustering
We consider the problem of quantizing data generated from disparate sources, e.g. subjects performing actions with different styles, movies with particular genre bias, various con...
Ekaterina Taralova, Fernando DelaTorre, Martial He...
ICPR
2010
IEEE
13 years 8 months ago
Improved Mean Shift Algorithm with Heterogeneous Node Weights
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
Ji Won Yoon, Simon P. Wilson