16430 search results - page 150 / 3286 » On Computable Tree Functions |
131
Voted
CCCG
2007
15 years 5 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
132
Voted
EJC
2010
15 years 3 months ago
2010
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
129
Voted
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
131
Voted
TWC
2008
15 years 3 months ago
2008
Abstract-- We present a unified detection framework for spatial multiplexing multiple-input multiple-output (MIMO) systems by generalizing Heller's classical feedback decoding...
133
Voted
CVPR
2011
IEEE
14 years 12 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...