301 search results - page 7 / 61 » Counting Models Using Connected Components |
161
click to vote
ICDCSW
2006
IEEE
15 years 12 months ago
2006
IEEE
The extent to which a wireless multi-hop network is connected is usually measured by the probability that all the nodes form a single connected component. We find this measure, c...
139
Voted
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
184
click to vote
ISSRE
2002
IEEE
15 years 10 months ago
2002
IEEE
An important aspect of developing models relating the number and type of faults in a software system to a set of structural measurement is defining what constitutes a fault. By de...
164
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
171
Voted
COREGRID
2007
Springer
15 years 12 months ago
2007
Springer
This paper presents a case study in the generic design of Grid component models. It defines a framework allowing two component systems, one running in a CCA environment, and anoth...