552 search results - page 58 / 111 » Lower bounds for dynamic connectivity |
ICC
2008
IEEE
14 years 4 months ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
COMPGEOM
2004
ACM
14 years 3 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...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
CCCG
2008
13 years 11 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...