Sciweavers

1060 search results - page 132 / 212
» On the Discovery of Random Trees
Sort
View
IWCMC
2010
ACM
15 years 4 months ago
High performance modified DSR routing protocol for WLAN mesh networks
This work presents a cross-layer modification to the DSR protocol which discovers high throughput paths on multi-hop wireless mesh networks. The modified DSR incorporates a metric...
Mustafa Ramadhan, Mark Davis
ICDE
2007
IEEE
115views Database» more  ICDE 2007»
16 years 7 months ago
Preservation Of Patterns and Input-Output Privacy
Abstract breaches. To do so, the data custodian needs to transform its data. To determine the appropriate transforPrivacy preserving data mining so far has mainly mation, there are...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng,...
VLDB
1999
ACM
151views Database» more  VLDB 1999»
15 years 10 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
BMCBI
2010
118views more  BMCBI 2010»
15 years 6 months ago
From learning taxonomies to phylogenetic learning: Integration of 16S rRNA gene data into FAME-based bacterial classification
Background: Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limit...
Bram Slabbinck, Willem Waegeman, Peter Dawyndt, Pa...
IS
2010
15 years 4 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley