Sciweavers

330 search results - page 63 / 66
» Algorithms for Propositional Model Counting
Sort
View
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
15 years 9 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
DASFAA
2004
IEEE
125views Database» more  DASFAA 2004»
15 years 1 months ago
Reducing Communication Cost in a Privacy Preserving Distributed Association Rule Mining
Data mining is a process that analyzes voluminous digital data in order to discover hidden but useful patterns from digital data. However, discovery of such hidden patterns has sta...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 4 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
INFOCOM
2007
IEEE
15 years 3 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
BMCBI
2008
153views more  BMCBI 2008»
14 years 9 months ago
2DB: a Proteomics database for storage, analysis, presentation, and retrieval of information from mass spectrometric experiments
Background: The amount of information stemming from proteomics experiments involving (multi dimensional) separation techniques, mass spectrometric analysis, and computational anal...
Jens Allmer, Sebastian Kuhlgert, Michael Hippler