Sciweavers

2487 search results - page 249 / 498
» Partitions of Graphs into Trees
Sort
View
CVPR
2011
IEEE
15 years 6 days ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
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...
Zhiding Yu, Oscar Au, Ketan Tang
TON
2012
13 years 6 months ago
Independent Directed Acyclic Graphs for Resilient Multipath Routing
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
Sangman Cho, Theodore Elhourani, Srinivasan Ramasu...
137
Voted
GBRPR
2007
Springer
15 years 10 months ago
Matching of Tree Structures for Registration of Medical Images
Many medical applications require a registration of different images of the same organ. In many cases, such a registration is accomplished by manually placing landmarks in the ima...
Jan Hendrik Metzen, Tim Kröger, Andrea Schenk...
DELTA
2004
IEEE
15 years 7 months ago
Arithmetic Transformations to Maximise the Use of Compressor Trees
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
Paolo Ienne, Ajay K. Verma
72
Voted
CORR
2007
Springer
86views Education» more  CORR 2007»
15 years 3 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert