Sciweavers

2072 search results - page 350 / 415
» Applications of Independent Component Analysis
Sort
View
IJCNN
2000
IEEE
14 years 1 months ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
CVPR
1999
IEEE
14 years 10 months ago
Background Estimation and Removal Based on Range and Color
Background estimation and removal based on the joint use of range and color data produces superior results than can be achieved with either data source alone. This is increasingly...
Gaile G. Gordon, Trevor Darrell, Michael Harville,...
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
14 years 9 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
MIDDLEWARE
2007
Springer
14 years 2 months ago
Flexible matching and ranking of web service advertisements
With the growing number of service advertisements in service marketplaces, there is a need for matchmakers which select and rank functionally similar services based on nonfunction...
Navid Ahmadi, Walter Binder
SIGCOMM
2006
ACM
14 years 2 months ago
Building an AS-topology model that captures route diversity
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
Wolfgang Mühlbauer, Anja Feldmann, Olaf Maenn...