1830 search results - page 155 / 366 » Workshop on Graph Computation Models |
182
click to vote
SEMCO
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper we present an automated support for software model evolution using a formal language constructs. For this, we extended Object Constraint Language (OCL) with actio...
144
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
150
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
167
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
160
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 5 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...