Sciweavers

1679 search results - page 53 / 336
» Pointcuts as Functional Queries
Sort
View
EXTREME
2004
ACM
15 years 9 months ago
A Simple Proof for the Turing-Completeness of XSLT and XQuery
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...
Stephan Kepser
JMLR
2010
173views more  JMLR 2010»
14 years 11 months ago
Collaborative Filtering via Rating Concentration
While most popular collaborative filtering methods use low-rank matrix factorization and parametric density assumptions, this article proposes an approach based on distribution-fr...
Bert Huang, Tony Jebara
LPAR
2007
Springer
15 years 10 months ago
Data Complexity in the EL Family of Description Logics
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
Adila Krisnadhi, Carsten Lutz
BTW
2009
Springer
117views Database» more  BTW 2009»
15 years 7 months ago
Bringing BLINK Closer to the Full Power of SQL
: BLINK is a prototype of an in-memory based query processor that exploits heavily the underlying CPU infrastructure. It is very sensitive to the processor’s caches and instructi...
Knut Stolze, Vijayshankar Raman, Richard Sidle, O....
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 4 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...