774 search results - page 82 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
DATE
2002
IEEE
14 years 2 months ago
2002
IEEE
With the term flexibility, we introduce a new design dimension of an embedded system that quantitatively characterizes its feasibility in implementing not only one, but possibly ...
COMPGEOM
1992
ACM
14 years 1 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
GBRPR
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
SCHOLARPEDIA
2011
12 years 12 months ago
2011
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
DCOSS
2006
Springer
14 years 22 days ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...