Sciweavers

2514 search results - page 362 / 503
» On the Computation of Approximations of Database Queries
Sort
View
186
Voted
PVLDB
2010
97views more  PVLDB 2010»
15 years 5 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
146
Voted
ISMIS
2005
Springer
16 years 11 days ago
Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
Manos Papagelis, Ioannis Rousidis, Dimitris Plexou...
ICML
2008
IEEE
16 years 7 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
178
Voted
ECIR
2004
Springer
15 years 8 months ago
Combining CORI and the Decision-Theoretic Approach for Advanced Resource Selection
In this paper we combine two existing resource selection approaches, CORI and the decision-theoretic framework (DTF). The state-of-the-art system CORI belongs to the large group of...
Henrik Nottelmann, Norbert Fuhr
PODS
2008
ACM
178views Database» more  PODS 2008»
16 years 7 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel