Sciweavers

256 search results - page 40 / 52
» Approximation Algorithms for Hamming Clustering Problems
Sort
View
PODS
2003
ACM
143views Database» more  PODS 2003»
15 years 9 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
HPDC
2000
IEEE
15 years 2 months ago
Performance Evaluation of a Firewall-Compliant Globus-based Wide-Area Cluster System
In this paper, we present a performance evaluation of a wide-area cluster system based on a rewallenabled Globus metacomputing toolkit. In order to establish communication links ...
Yoshio Tanaka, Motonori Hirano, Mitsuhisa Sato, Hi...
HIPC
2004
Springer
15 years 3 months ago
Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction
Parasitic extraction techniques are used to estimate signal delay in VLSI chips. Inductance extraction is a critical component of the parasitic extraction process in which on-chip ...
Hemant Mahawar, Vivek Sarin, Ananth Grama
IIS
2003
14 years 11 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
CVPR
2009
IEEE
16 years 4 months ago
Stochastic Gradient Kernel Density Mode-Seeking
As a well known fixed-point iteration algorithm for kernel density mode-seeking, Mean-Shift has attracted wide attention in pattern recognition field. To date, Mean-Shift algorit...
Xiaotong Yuan, Stan Z. Li