16 search results - page 3 / 4 » Competitive Maintenance of Minimum Spanning Trees in Dynamic... |
INFOCOM
2009
IEEE
14 years 1 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
MOBIHOC
2002
ACM
14 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
PODS
1994
ACM
13 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...