Sciweavers

941 search results - page 66 / 189
» Efficient Testing of Large Graphs
Sort
View
ESANN
2003
14 years 11 months ago
Comparison of neural algorithms for blind source separation in sensor array applications
- A test bed of experiments with real and artificially generated data has been designed to compare the performance of three well-known algorithms for BSS. The main goal of these ex...
Guillermo Bedoya, Sergio Bermejo, Joan Cabestany
CIKM
2009
Springer
15 years 4 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
BMCBI
2008
186views more  BMCBI 2008»
14 years 10 months ago
Variable selection for large p small n regression models with incomplete data: Mapping QTL with epistases
Background: Identifying quantitative trait loci (QTL) for both additive and epistatic effects raises the statistical issue of selecting variables from a large number of candidates...
Min Zhang, Dabao Zhang, Martin T. Wells
JCM
2008
242views more  JCM 2008»
14 years 9 months ago
SimANet - A Large Scalable, Distributed Simulation Framework for Ambient Networks
In this paper, we present a new simulation platform for complex, radio standard spanning mobile Ad Hoc networks. SimANet - Simulation Platform for Ambient Networks - allows the coe...
Matthias Vodel, Matthias Sauppe, Mirko Caspar, Wol...
BMCBI
2008
122views more  BMCBI 2008»
14 years 10 months ago
Effects of dependence in high-dimensional multiple testing problems
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...
Kyung In Kim, Mark A. van de Wiel