Sciweavers

Share
ICFP
2012
ACM
6 years 9 months ago
Shake before building: replacing make with haskell
Most complex software projects are compiled using a build tool (e.g. make), which runs commands in an order satisfying userdefined dependencies. Unfortunately, most build tools r...
Neil Mitchell
ICDT
2012
ACM
226views Database» more  ICDT 2012»
6 years 9 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
SIGIR
2012
ACM
6 years 9 months ago
Utilizing inter-document similarities in federated search
We demonstrate the merits of using inter-document similarities for federated search. Specifically, we study a resultsmerging method that utilizes information induced from cluster...
Savva Khalaman, Oren Kurland
SIGIR
2012
ACM
6 years 9 months ago
Language intent models for inferring user browsing behavior
Modeling user browsing behavior is an active research area with tangible real-world applications, e.g., organizations can adapt their online presence to their visitors browsing be...
Manos Tsagkias, Roi Blanco
SIGIR
2012
ACM
6 years 9 months ago
BReK12: a book recommender for K-12 users
Ideally, students in K-12 grade levels can turn to book recommenders to locate books that match their interests. Existing book recommenders, however, fail to take into account the...
Maria Soledad Pera, Yiu-Kai Ng
SIGIR
2012
ACM
6 years 9 months ago
Active query selection for learning rankers
Methods that reduce the amount of labeled data needed for training have focused more on selecting which documents to label than on which queries should be labeled. One exception t...
Mustafa Bilgic, Paul N. Bennett
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
6 years 9 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
6 years 9 months ago
Sampling minimal frequent boolean (DNF) patterns
We tackle the challenging problem of mining the simplest Boolean patterns from categorical datasets. Instead of complete enumeration, which is typically infeasible for this class ...
Geng Li, Mohammed J. Zaki
KDD
2012
ACM
221views Data Mining» more  KDD 2012»
6 years 9 months ago
Fast mining and forecasting of complex time-stamped events
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
Yasuko Matsubara, Yasushi Sakurai, Christos Falout...
SIGMOD
2012
ACM
275views Database» more  SIGMOD 2012»
6 years 9 months ago
Computational reproducibility: state-of-the-art, challenges, and database research opportunities
Computational experiments have become an integral part of the scientific method, but reproducing, archiving, and querying them is still a challenge. The first barrier to a wider...
Juliana Freire, Philippe Bonnet, Dennis Shasha
books