903 search results - page 3 / 181 » Non-well-founded trees in categories |
105
click to vote
NETWORKING
2004
15 years 1 months ago
2004
Abstract. End System Multicasting (ESM) is fast becoming a feasible alternative to IP multicasting. ESM approaches can be broadly classified into two main categories: (i) Tree firs...
89
Voted
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Suppose a set of images contains frequent occurrences of objects from an unknown category. This paper is aimed at simultaneously solving the following related problems: (1) unsupe...
106
Voted
TOG
2012
13 years 2 months ago
2012
We present a dynamic tree modeling and representation technique that allows complex tree models to interact with their environment. Our method uses changes in the light distributi...
115
Voted
JUCS
2007
14 years 11 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
88
Voted
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...