Sciweavers

672 search results - page 93 / 135
» Lower-stretch spanning trees
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 8 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
ICIP
2000
IEEE
14 years 9 months ago
Combined Spatial and Subband Block Coding of Images
This paper describes a low-memory cache efficient Hybrid Block Coder (HBC) for images in which an image subband decomposition is partitioned into a combination of spatial blocks a...
Frederick W. Wheeler, William A. Pearlman
MICCAI
2003
Springer
14 years 8 months ago
Segmenting 3D Branching Tubular Structures Using Cores
Blood vessels and other anatomic objects in the human body can be described as trees of branching tubes. The focus of this paper is the extraction of the branching geometry in 3D, ...
Yonatan Fridman, Stephen M. Pizer, Stephen R. Aylw...
ICML
2005
IEEE
14 years 8 months ago
Learning hierarchical multi-category text classification models
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is...
Craig Saunders, John Shawe-Taylor, Juho Rousu, S&a...
DCC
2001
IEEE
14 years 7 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher