Sciweavers

301 search results - page 7 / 61
» Counting Models Using Connected Components
Sort
View
ICDCSW
2006
IEEE
14 years 2 months ago
Characterization of a Connectivity Measure for Sparse Wireless Multi-hop Networks
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...
Srinath Perur, Sridhar Iyer
COMPGEOM
2004
ACM
14 years 2 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
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...
Hervé Brönnimann, Olivier Devillers, V...
ISSRE
2002
IEEE
14 years 1 months ago
Toward A Quantifiable Definition of Software Faults
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...
John C. Munson, Allen P. Nikora
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
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...
Mihai Patrascu, Erik D. Demaine
COREGRID
2007
Springer
14 years 2 months ago
Interoperability of Grid component models: GCM and CCA case study
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...
Maciej Malawski, Marian Bubak, Françoise Ba...