Sciweavers

364 search results - page 10 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
MOBIHOC
2005
ACM
15 years 9 months ago
A secure ad-hoc routing approach using localized self-healing communities
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
Jiejun Kong, Xiaoyan Hong, Yunjung Yi, Joon-Sang P...
ICDAR
2007
IEEE
15 years 3 months ago
Energy-Based Models in Document Recognition and Computer Vision
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
Yann LeCun, Sumit Chopra, Marc'Aurelio Ranzato, Fu...
AINA
2008
IEEE
14 years 11 months ago
Monitoring Network Traffic to Detect Stepping-Stone Intrusion
Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed t...
Jianhua Yang, Byong Lee, Stephen S. H. Huang
JSAC
2008
98views more  JSAC 2008»
14 years 9 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
TSP
2008
179views more  TSP 2008»
14 years 9 months ago
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
V. Chandrasekaran, Jason K. Johnson, Alan S. Wills...