Sciweavers

2484 search results - page 304 / 497
» Polymatroids with Network Coding
Sort
View
DAM
1998
88views more  DAM 1998»
13 years 8 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
TSE
1998
152views more  TSE 1998»
13 years 8 months ago
Communication and Organization: An Empirical Study of Discussion in Inspection Meetings
—This paper describes an empirical study that addresses the issue of communication among members of a software development organization. In particular, data was collected concern...
Carolyn B. Seaman, Victor R. Basili
MIDDLEWARE
2009
Springer
14 years 2 months ago
DR-OSGi: Hardening Distributed Components with Network Volatility Resiliency
Abstract. Because middleware abstractions remove the need for lowlevel network programming, modern distributed component systems expose network volatility (i.e., frequent but inter...
Young-Woo Kwon, Eli Tilevich, Taweesup Apiwattanap...
MOBICOM
2006
ACM
14 years 2 months ago
A coordinate-based approach for exploiting temporal-spatial diversity in wireless mesh networks
In this paper, we consider the problem of mitigating interference and improving network capacity in wireless mesh networks from the angle of temporal-spatial diversity. In a nutsh...
Hyuk Lim, Chaegwon Lim, Jennifer C. Hou
WS
2006
ACM
14 years 2 months ago
Proactive security for mobile messaging networks
The interoperability of IM (Instant Messaging) and SMS (Short Messaging Service) networks allows users to seamlessly use a variety of computing devices from desktops to cellular p...
Abhijit Bose, Kang G. Shin