Sciweavers

1945 search results - page 136 / 389
» Pursuit-Evasion in Models of Complex Networks
Sort
View
MOBIHOC
2009
ACM
14 years 8 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 8 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
IVC
2000
104views more  IVC 2000»
13 years 8 months ago
Learning spatio-temporal patterns for predicting object behaviour
Rule-based systems employed to model complex object behaviours, do not necessarily provide a realistic portrayal of true behaviour. To capture the real characteristics in a specif...
Neil Sumpter, Andrew J. Bulpitt
IM
2007
13 years 8 months ago
Growing Protean Graphs
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
Pawel Pralat, Nicholas C. Wormald
IJCNN
2006
IEEE
14 years 2 months ago
Venn-like models of neo-cortex patches
— This work presents a new architecture of artificial neural networks – Venn Networks, which produce localized activations in a 2D map while executing simple cognitive tasks. T...
Fernando Buarque de Lima Neto, Philippe De Wilde