Sciweavers

5114 search results - page 62 / 1023
» Complex networks
Sort
View
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
14 years 1 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
ICANN
2005
Springer
14 years 2 months ago
Image Segmentation by Complex-Valued Units
Spike synchronisation and de-synchronisation are important for feature binding and separation at various levels in the visual system. We present a model of complex valued neuron ac...
Cornelius Weber, Stefan Wermter
INTERACT
2007
13 years 10 months ago
ICEbox: Toward Easy-to-Use Home Networking
Home networking is becoming an essential part of everyday life. However, empirical studies and consumer reports indicate that the complexities of configuring and maintaining the ho...
Jeonghwa Yang, W. Keith Edwards
OPODIS
2007
13 years 10 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
INFOCOM
2007
IEEE
14 years 3 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo