Sciweavers

526 search results - page 97 / 106
» Improved Decomposition of STGs
Sort
View
ICML
2004
IEEE
14 years 10 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 10 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
WWW
2007
ACM
14 years 10 months ago
Demographic prediction based on user's browsing behavior
Demographic information plays an important role in personalized web applications. However, it is usually not easy to obtain this kind of personal data such as age and gender. In t...
Jian Hu, Hua-Jun Zeng, Hua Li, Cheng Niu, Zheng Ch...
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 10 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 10 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...