Sciweavers

1517 search results - page 279 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
BTW
2007
Springer
136views Database» more  BTW 2007»
15 years 3 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann
IPSN
2007
Springer
15 years 3 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 1 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
78
Voted
DEXAW
1998
IEEE
92views Database» more  DEXAW 1998»
15 years 1 months ago
Self-Configuring Components for Client-/Server-Applications
A mechanistic view of software component assembly implies exact matching and fitting of the particular components. We argue that components for large-scale software construction s...
Wolfgang Pree, Egbert Althammer, Hermann Sikora
BMCBI
2010
130views more  BMCBI 2010»
14 years 9 months ago
The behaviour of random forest permutation-based variable importance measures under predictor correlation
Background: Random forests (RF) have been increasingly used in applications such as genome-wide association and microarray studies where predictor correlation is frequently observ...
Kristin K. Nicodemus, James D. Malley, Carolin Str...