Sciweavers

707 search results - page 72 / 142
» Processing queries on tree-structured data efficiently
Sort
View
SIGIR
2011
ACM
12 years 11 months ago
Functional matrix factorizations for cold-start recommendation
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Ke Zhou, Shuang-Hong Yang, Hongyuan Zha
DAWAK
2005
Springer
14 years 2 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
PODS
2009
ACM
229views Database» more  PODS 2009»
14 years 9 months ago
Computing all skyline probabilities for uncertain data
Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...
Mikhail J. Atallah, Yinian Qi
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
14 years 9 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 8 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...