Sciweavers

5658 search results - page 791 / 1132
» An Efficient Counting Network
Sort
View
ICDCS
2010
IEEE
15 years 8 months ago
Opportunistic Routing for Interactive Traffic in Wireless Networks
Abstract--To take advantage of the broadcast nature of wireless communication, a number of opportunistic routing techniques have recently been proposed. In order to manage the extr...
Tianji Li, Douglas J. Leith, Lili Qiu
SERVICES
2008
103views more  SERVICES 2008»
15 years 8 months ago
Grouping Distributed Stream Query Services by Operator Similarity and Network Locality
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
Sangeetha Seshadri, Bhuvan Bamba, Brian F. Cooper,...
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 8 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
CIC
2004
15 years 8 months ago
Dynamic Characteristics of k-ary n-cube Networks for Real-time Communication
Overlay topologies are now popular with many emerging peer-to-peer (P2P) systems, to efficiently locate and retrieve information. In contrast, the focus of this work is to use ove...
Gerald Fry, Richard West
P2PKM
2004
15 years 8 months ago
Ontology-based Service Discovery in P2P Networks
The ubiquitous computing vision is to make knowledge and services easily available in our everyday environments. A wide range of devices, applications and services can be intercon...
Daniel Elenius, Magnus Ingmarsson