Sciweavers

1176 search results - page 85 / 236
» Distributed Selective Dissemination of Information
Sort
View
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 4 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
CIKM
2005
Springer
15 years 10 months ago
Information retrieval and machine learning for probabilistic schema matching
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
Henrik Nottelmann, Umberto Straccia
BMCBI
2010
146views more  BMCBI 2010»
15 years 4 months ago
Genomic selection and complex trait prediction using a fast EM algorithm applied to genome-wide markers
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
Ross K. Shepherd, Theo H. E. Meuwissen, John A. Wo...
WISE
2007
Springer
15 years 10 months ago
Optimization of Bounded Continuous Search Queries Based on Ranking Distributions
A common search problem in the World Wide Web concerns finding information if it is not known when the sources of information appear and how long sources will be available on the ...
Dirk Kukulenz, Nils Hoeller, Sven Groppe, Volker L...
EWSN
2008
Springer
16 years 4 months ago
Resilient Coding Algorithms for Sensor Network Data Persistence
Storing and disseminating coded information instead of the original data can bring significant performance improvements to sensor network protocols. Such methods reduce the risk of...
Daniele Munaretto, Jörg Widmer, Michele Rossi...