Sciweavers

680 search results - page 101 / 136
» A randomized embedding algorithm for trees
Sort
View
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
16 years 2 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
117
Voted
TMC
2008
127views more  TMC 2008»
15 years 2 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
RTCSA
2000
IEEE
15 years 5 months ago
Efficient resource management for hard real-time communication over differentiated services architectures
We propose an efficient strategy for resource management for scalable QoS guaranteed real-time communication services. This strategy is based on sink trees, and is particularly we...
Byung-Kyu Choi, Riccardo Bettati
JOT
2008
67views more  JOT 2008»
15 years 2 months ago
An Enhanced Form of Dynamic Untyped Object-Based Inheritance
We present an enhanced form of untyped object-based inheritance for classless languages, as implemented in our Delta language, comparing to the prevalent practices of delegation a...
Anthony Savidis
134
Voted
MTA
2006
115views more  MTA 2006»
15 years 2 months ago
Tree-assisted gossiping for overlay video distribution
Given its readily deployable nature and broad applications for digital entertainment, video streaming through overlay networks has received much attention recently. While a tree to...
Jiangchuan Liu, Ming Zhou