Sciweavers

312 search results - page 7 / 63
» Degree Bounded Network Design with Metric Costs
Sort
View
EDCC
2005
Springer
14 years 1 months ago
Structure-Based Resilience Metrics for Service-Oriented Networks
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Ja...
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
14 years 1 months ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
TMC
2011
131views more  TMC 2011»
13 years 2 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
ICC
2007
IEEE
118views Communications» more  ICC 2007»
14 years 1 months ago
Critical Design Decisions for Cognitive Networks
— The idea of the cognitive network, drawn from previous research in cognitive radios and cross-layer design, is an attempt to address issues of complexity and scalability by all...
Ryan W. Thomas, Luiz A. DaSilva, Madhav V. Marathe...
VLDB
2007
ACM
169views Database» more  VLDB 2007»
14 years 7 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...