279 search results - page 48 / 56 » Degree-bounded minimum spanning trees |
CVPR
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a new, robust and computationally efficient method for estimating the probability density of the intensity values in an image. Our approach makes use of a continuous r...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
ICPP
2005
IEEE
14 years 29 days ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
IPPS
2002
IEEE
14 years 9 days ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
ACID
2006
13 years 8 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...