Sciweavers

970 search results - page 117 / 194
» On encodings of spanning trees
Sort
View
CIKM
2006
Springer
14 years 21 days ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
MICCAI
2003
Springer
14 years 9 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 9 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 8 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
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 3 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh