Sciweavers

28 search results - page 5 / 6
» Downsampling graphs using spectral theory
Sort
View
DAGM
2004
Springer
14 years 28 days ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
INFOCOM
2010
IEEE
13 years 6 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
INFOCOM
2009
IEEE
14 years 2 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
ICASSP
2010
IEEE
13 years 7 months ago
Graph-spectrum-based neural spike features for stereotrodes and tetrodes
Extracellular recording of neural signals records the action potentials (known as spikes) of neurons adjacent to the electrode as well as the noise generated by the overall neural...
Yasser Ghanbari, Panos Papamichalis, Larry Spence
SIAMREV
2010
170views more  SIAMREV 2010»
13 years 2 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham