Sciweavers

2466 search results - page 128 / 494
» Algorithms for distributed functional monitoring
Sort
View
140
Voted
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
16 years 3 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
117
Voted
MOBIHOC
2008
ACM
16 years 2 months ago
Cooperative transmit-power estimation under wireless fading
We study blind estimation of transmission power of a node based on received power measurements obtained under wireless fading. Specifically, the setup consists of a set of monitor...
Murtaza Zafer, Bongjun Ko, Ivan Wang Hei Ho
114
Voted
INFOCOM
2011
IEEE
14 years 6 months ago
Hidden communication in P2P networks Steganographic handshake and broadcast
—We consider the question of how a conspiring subgroup of peers in a p2p network can find each other and communicate without provoking suspicion among regular peers or an author...
Raphael Eidenbenz, Thomas Locher, Roger Wattenhofe...
113
Voted
BMCBI
2010
160views more  BMCBI 2010»
15 years 2 months ago
Identification of functional hubs and modules by converting interactome networks into hierarchical ordering of proteins
Background: Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein intera...
Young-Rae Cho, Aidong Zhang
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 1 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna