307 search results - page 58 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
COMSWARE
2008
IEEE
13 years 9 months ago
2008
IEEE
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
VMV
2004
13 years 8 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...