Sciweavers

1389 search results - page 151 / 278
» Lightweight dependent classes
Sort
View
ADHOCNOW
2008
Springer
14 years 4 months ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis
ICDCS
2007
IEEE
14 years 4 months ago
Self-Similar Algorithms for Dynamic Distributed Systems
This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may ceas...
K. Mani Chandy, Michel Charpentier
VTC
2007
IEEE
123views Communications» more  VTC 2007»
14 years 4 months ago
On the Effects of Aggregation on Reliability in Sensor Networks
— Data collected in a sensor network is transported hop-by-hop to a sink for further analysis. The quality of the analysis depends on the amount of data reaching the sink. Hence,...
Jonathan P. Benson, Utz Roedig, André M. Ba...
TLCA
2007
Springer
14 years 4 months ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
CSFW
2006
IEEE
14 years 4 months ago
Securing Interaction between Threads and the Scheduler
The problem of information flow in multithreaded programs remains an important open challenge. Existing approaches to specifying and enforcing information-flow security often su...
Alejandro Russo, Andrei Sabelfeld