Sciweavers

3558 search results - page 678 / 712
» Object-Oriented Programming on the Network
Sort
View
RSA
2008
123views more  RSA 2008»
13 years 7 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 6 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
INFOCOM
2010
IEEE
13 years 6 months ago
Asymmetry-Aware Real-Time Distributed Joint Resource Allocation in IEEE 802.22 WRANs
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
Hyoil Kim, Kang G. Shin
ISSRE
2010
IEEE
13 years 6 months ago
Automating System Tests Using Declarative Virtual Machines
—Automated regression test suites are an essential software engineering practice: they provide developers with rapid feedback on the impact of changes to a system’s source code...
Sander van der Burg, Eelco Dolstra
VTC
2010
IEEE
201views Communications» more  VTC 2010»
13 years 6 months ago
iTETRIS: Adaptation of ITS Technologies for Large Scale Integrated Simulation
1 —the European Union (EU) Framework Program 7 (FP7) funded project, iTETRIS [1] (An Integrated Wireless and Traffic Platform for Real-Time Road Traffic Management Solutions) tar...
Vineet Kumar, Lan Lin, Daniel Krajzewicz, Fatma Hr...