Sciweavers

776 search results - page 41 / 156
» Distributed Information Regularization on Graphs
Sort
View
108
Voted
SBP
2011
Springer
14 years 7 months ago
Ranking Information in Networks
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
Tina Eliassi-Rad, Keith Henderson
111
Voted
EMMCVPR
2005
Springer
15 years 6 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
WINE
2005
Springer
179views Economy» more  WINE 2005»
15 years 6 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
108
Voted
DCOSS
2006
Springer
15 years 4 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
ICDCSW
2005
IEEE
15 years 6 months ago
Parallel Bindings in Distributed Multimedia Systems
Today’s multimedia environments are characterized by different stationary and a growing number of mobile devices, like PDAs or even mobile phones. To meet their requirements reg...
Michael Repplinger, Florian Winter, Marco Lohse, P...