Sciweavers

2374 search results - page 124 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
IMC
2010
ACM
15 years 4 days ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
ICCV
1999
IEEE
16 years 4 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ANCS
2005
ACM
15 years 7 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood
ICC
2007
IEEE
145views Communications» more  ICC 2007»
15 years 8 months ago
Distributed Optimization for Utility-Energy Tradeoff in Wireless Sensor Networks
Abstract— Wireless sensor networks (WSNs) are energyconstrained in nature, in this paper, we formulate the problem of data transport in sensor networks as a network utility maxim...
Shengbin Liao, Wenqing Cheng, Wei Liu, Zongkai Yan...
IPPS
2006
IEEE
15 years 8 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang