672 search results - page 106 / 135 » Lower-stretch spanning trees |
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
COLING
2010
13 years 2 months ago
2010
In practical applications, decoding speed is very important. Modern structured learning technique adopts template based method to extract millions of features. Complicated templat...
MOBIHOC
2002
ACM
14 years 7 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...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...