Sciweavers

2635 search results - page 400 / 527
» Algorithms for the Database Layout Problem
Sort
View
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
16 years 4 months ago
Predicting customer shopping lists from point-of-sale purchase data
This paper describes a prototype that predicts the shopping lists for customers in a retail store. The shopping list prediction is one aspect of a larger system we have developed ...
Chad M. Cumby, Andrew E. Fano, Rayid Ghani, Marko ...
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
16 years 4 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 4 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
PR
2006
113views more  PR 2006»
15 years 4 months ago
Face recognition from a single image per person: A survey
One of the main challenges faced by the current face recognition techniques lies in the difficulties of collecting samples. Fewer samples per person mean less laborious effort for...
Xiaoyang Tan, Songcan Chen, Zhi-Hua Zhou, Fuyan Zh...
KDD
2009
ACM
194views Data Mining» more  KDD 2009»
16 years 5 months ago
Combining link and content for community detection: a discriminative approach
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
Tianbao Yang, Rong Jin, Yun Chi, Shenghuo Zhu