3008 search results - page 514 / 602 » Independence in connected graphs |
172
click to vote
FSKD
2009
Springer
16 years 28 days ago
2009
Springer
Usually a meaningful web topic has tens of thousands of comments, especially the hot topics. It is valuable if we congregate the comments into clusters and find out the mainstrea...
168
click to vote
FSTTCS
2009
Springer
16 years 28 days ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
169
click to vote
JSSPP
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System S. Capable of processing enormous quantitie...
141
click to vote
MODELS
2009
Springer
16 years 27 days ago
2009
Springer
We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one o...
159
click to vote
CDC
2008
IEEE
16 years 25 days ago
2008
IEEE
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...