Sciweavers

1146 search results - page 201 / 230
» Optimizing Frequency Queries for Data Mining Applications
Sort
View
DEXA
2000
Springer
132views Database» more  DEXA 2000»
14 years 3 days ago
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
Kurt Stockinger, Dirk Düllmann, Wolfgang Hosc...
JCDL
2011
ACM
301views Education» more  JCDL 2011»
12 years 10 months ago
Archiving the web using page changes patterns: a case study
A pattern is a model or a template used to summarize and describe the behavior (or the trend) of a data having generally some recurrent events. Patterns have received a considerab...
Myriam Ben Saad, Stéphane Gançarski
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 9 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 2 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
USS
2010
13 years 5 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...