Sciweavers

322 search results - page 50 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 14 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
ECCV
2008
Springer
14 years 9 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto
APWEB
2004
Springer
14 years 1 months ago
Semantic, Hierarchical, Online Clustering of Web Search Results
Today, search engine is the most commonly used tool for Web information retrieval, however, its current status is still far from satisfaction. This paper focuses on clustering Web...
Dell Zhang, Yisheng Dong
IJCNN
2000
IEEE
14 years 1 days ago
ICA for Noisy Neurobiological Data
ICA (Independent Component Analysis) is a new technique for analyzing multi-variant data. Lots of results are reported in the field of neurobiological data analysis such as EEG (...
Shiro Ikeda, Keisuke Toyama
RECSYS
2010
ACM
13 years 7 months ago
Recommending based on rating frequencies
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
Fatih Gedikli, Dietmar Jannach