Sciweavers

91 search results - page 1 / 19
» Research Note - When Is Versioning Optimal for Information G...
Sort
View
ELPUB
1998
ACM
13 years 9 months ago
Research Information Take Away or How to Serve Research Information Fast and Friendly on the Web
In 1997 the library department at the University of Karlskrona/Ronneby was asked to develop a database which could be used to collate and present all the research material and ong...
Peter Linde, Leif Lagebrand
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 4 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
SIGIR
2012
ACM
11 years 7 months ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel
CIKM
2010
Springer
13 years 3 months ago
Improved index compression techniques for versioned document collections
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
Jinru He, Junyuan Zeng, Torsten Suel
ICDE
2010
IEEE
238views Database» more  ICDE 2010»
13 years 11 months ago
Correlation hiding by independence masking
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
Yufei Tao, Jian Pei, Jiexing Li, Xiaokui Xiao, Ke ...