Sciweavers

3377 search results - page 510 / 676
» Describing differences between databases
Sort
View
KDD
2009
ACM
223views Data Mining» more  KDD 2009»
14 years 9 months ago
Collaborative filtering with temporal dynamics
Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are ...
Yehuda Koren
RECOMB
2004
Springer
14 years 9 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 9 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
VLDB
2008
ACM
136views Database» more  VLDB 2008»
14 years 9 months ago
Efficient updates in dynamic XML data: from binary string to quaternary string
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more a...
Changqing Li, Tok Wang Ling, Min Hu
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 9 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng