Sciweavers

774 search results - page 120 / 155
» A New Graph Triconnectivity Algorithm and Its Parallelizatio...
Sort
View
COMSWARE
2007
IEEE
14 years 3 months ago
Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
François Ingelrest, David Simplot-Ryl, Ivan...
WWW
2005
ACM
14 years 9 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
TROB
2008
159views more  TROB 2008»
13 years 8 months ago
Distributed Connectivity Control of Mobile Networks
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
Michael M. Zavlanos, George J. Pappas
IPPS
2006
IEEE
14 years 3 months ago
Dynamic multi phase scheduling for heterogeneous clusters
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, concurrent programming methods in distributed systems have not been studi...
Florina M. Ciorba, Theodore Andronikos, Ioannis Ri...
COMPGEOM
2004
ACM
14 years 2 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi