Sciweavers

1485 search results - page 184 / 297
» connection 2010
Sort
View
TNN
2010
147views Management» more  TNN 2010»
15 years 20 days ago
Theoretical Model for Mesoscopic-Level Scale-Free Self-Organization of Functional Brain Networks
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
J. Piersa, Filip Piekniewski, Tomasz Schreiber
TWC
2010
15 years 19 days ago
Pi: a practical incentive protocol for delay tolerant networks
Delay Tolerant Networks (DTNs) are a class of networks characterized by lack of guaranteed connectivity, typically low frequency of encounters between DTN nodes and long propagatio...
Rongxing Lu, Xiaodong Lin, Haojin Zhu, Xuemin Shen...
ICDE
2010
IEEE
208views Database» more  ICDE 2010»
16 years 5 months ago
Intensional Associations in Dataspaces
Dataspace applications necessitate the creation of associations among data items over time. For example, once information about people is extracted from sources on the Web, associa...
Marcos Antonio Vaz Salles, Jens Dittrich, Lukas Bl...
POPL
2010
ACM
16 years 3 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
16 years 3 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari