Sciweavers

23098 search results - page 4361 / 4620
» Component Based Development
Sort
View
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
16 years 7 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 7 months ago
Applying syntactic similarity algorithms for enterprise information management
: ? Applying Syntactic Similarity Algorithms for Enterprise Information Management Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph Tucek, Alistair Veitch HP Laborato...
Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey...
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 7 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
MOBISYS
2009
ACM
16 years 7 months ago
R2D2: regulating beam shape and rate as directionality meets diversity
We design, implement, and evaluate a vehicular communication system that improves uplink connectivity through multi-lobe beam pattern switching on a smart antenna. Directionality ...
Kishore Ramachandran, Ravi Kokku, Karthikeyan Sund...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 7 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
« Prev « First page 4361 / 4620 Last » Next »