Sciweavers

13214 search results - page 44 / 2643
» Pseudorandomness for network algorithms
Sort
View
WIOPT
2010
IEEE
15 years 4 months ago
Static community detection algorithms for evolving networks
—Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform thei...
Thomas Aynaud, Jean-Loup Guillaume
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
15 years 11 months ago
Lower Bounds on Correction Networks
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such netw...
Grzegorz Stachowiak
SAGA
2007
Springer
16 years 4 days ago
Randomized Algorithms and Probabilistic Analysis in Wireless Networking
Abstract. Devices connected wirelessly, in various forms including computers, hand-held devices, ad hoc networks, and embedded systems, are expected to become ubiquitous all around...
Aravind Srinivasan
NETWORKS
2008
15 years 6 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
ICASSP
2011
IEEE
14 years 9 months ago
Fast network querying algorithm for searching large-scale biological networks
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
Sayed Mohammad Ebrahim Sahraeian, Byung-Jun Yoon