Sciweavers

36 search results - page 2 / 8
» Greedy Recommending Is Not Always Optimal
Sort
View
EDBT
2008
ACM
159views Database» more  EDBT 2008»
14 years 5 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani
VLDB
1994
ACM
114views Database» more  VLDB 1994»
13 years 9 months ago
Including Group-By in Query Optimization
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Surajit Chaudhuri, Kyuseok Shim
JCP
2006
117views more  JCP 2006»
13 years 5 months ago
Empirical Analysis of Attribute-Aware Recommender System Algorithms Using Synthetic Data
As the amount of online shoppers grows rapidly, the need of recommender systems for e-commerce sites are demanding, especially when the number of users and products being offered o...
Karen H. L. Tso, Lars Schmidt-Thieme
IPPS
2006
IEEE
13 years 11 months ago
Skewed allocation of non-uniform data for broadcasting over multiple channels
The problem of data broadcasting over multiple channels consists in partitioning data among channels, depending on data popularities, and then cyclically transmitting them over ea...
Alan A. Bertossi, Maria Cristina Pinotti
TCS
2002
13 years 4 months ago
Asymptotic behavior in a heap model with two pieces
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
Jean Mairesse, Laurent Vuillon