Sciweavers

304 search results - page 38 / 61
» Fast power grid simulation
Sort
View
74
Voted
ESANN
2004
14 years 11 months ago
Fast semi-automatic segmentation algorithm for Self-Organizing Maps
Self-Organizing Maps (SOM) are very powerful tools for data mining, in particular for visualizing the distribution of the data in very highdimensional data sets. Moreover, the 2D m...
David Opolon, Fabien Moutarde
TON
2008
125views more  TON 2008»
14 years 9 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
P2P
2006
IEEE
153views Communications» more  P2P 2006»
15 years 3 months ago
A Reciprocation-Based Economy for Multiple Services in Peer-to-Peer Grids
Peer-to-peer grids aim to build computational grids encompassing thousands of sites. To achieve this scale, such systems cannot rely on trust or off-line negotiations among partic...
Miranda Mowbray, Francisco Vilar Brasileiro, Nazar...
BMCBI
2010
84views more  BMCBI 2010»
14 years 9 months ago
A variational Bayes algorithm for fast and accurate multiple locus genome-wide association analysis
Background: The success achieved by genome-wide association (GWA) studies in the identification of candidate loci for complex diseases has been accompanied by an inability to expl...
Benjamin A. Logsdon, Gabriel E. Hoffman, Jason G. ...
130
Voted
TMC
2012
12 years 12 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...