Sciweavers

2600 search results - page 474 / 520
» Clustering with or without the Approximation
Sort
View
ECCV
2006
Springer
14 years 9 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 8 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
WWW
2001
ACM
14 years 8 months ago
On representation of a highlight on the Web: the amber room as a cultural phenomenon in progress
"The Amber Room on the Web" project provides wide public access to information about the process of reconstruction of the Amber Room of the Catherine Palace outside of S...
Tatyana G. Bogomazova, Cyrill A. Malevanov
ASPLOS
2009
ACM
14 years 8 months ago
Mixed-mode multicore reliability
Future processors are expected to observe increasing rates of hardware faults. Using Dual-Modular Redundancy (DMR), two cores of a multicore can be loosely coupled to redundantly ...
Philip M. Wells, Koushik Chakraborty, Gurindar S. ...
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
14 years 8 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...