Sciweavers

4072 search results - page 379 / 815
» Designing an Optimal Network Using the Cross-Entropy Method
Sort
View
SCIA
2005
Springer
158views Image Analysis» more  SCIA 2005»
15 years 10 months ago
A Graph Representation of Filter Networks
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
Björn Svensson, Mats T. Andersson, Hans Knuts...
EDBTW
2004
Springer
15 years 10 months ago
SPROUT: P2P Routing with Social Networks
In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links. We present a trust model t...
Sergio Marti, Prasanna Ganesan, Hector Garcia-Moli...
PODC
2003
ACM
15 years 10 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
IJIPT
2008
191views more  IJIPT 2008»
15 years 4 months ago
ARPM: Agent-based Routing Protocol for MANET
Mobile ad-hoc networks (MANETs) are infrastructure-less networks where no central network management exists, composed of mobile nodes over wireless links. Network topology in MANE...
Helen Bakhsh, Manal Abdullah
KDD
2012
ACM
242views Data Mining» more  KDD 2012»
13 years 7 months ago
Query-driven discovery of semantically similar substructures in heterogeneous networks
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and ...
Xiao Yu, Yizhou Sun, Peixiang Zhao, Jiawei Han