Sciweavers

1259 search results - page 234 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
SP
1989
IEEE
13 years 11 months ago
Security Issues in Policy Routing
Routing mechanisms for inter-autonomousregion communication require distribution of policy-sensitive information as well as algorithms that operate on such information. Without su...
Deborah Estrin, Gene Tsudik
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 7 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
ICC
2007
IEEE
170views Communications» more  ICC 2007»
13 years 11 months ago
Adaptive Power Loading for OFDM-Based Cognitive Radio Systems
Abstract--Cognitive radio (CR) technology is an innovative radio design philosophy which aims to increase spectrum utilization by exploiting unused spectrum in dynamically changing...
Gaurav Bansal, Md. Jahangir Hossain, Vijay K. Bhar...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
SAC
2002
ACM
13 years 7 months ago
Concurrency control for distributed cooperative engineering applications
Distributed cooperative engineering applications require consistent and long-term sharing of large volumes of data, which may cause conflicts due to concurrent read/write operatio...
João Coelho Garcia, Paulo Ferreira