Search Sciweavers | Sciweavers

30

NETWORKS
2010

135views Computer Networks» more NETWORKS 2010»

Probabilistic models for the Steiner Tree problem

13 years 6 months ago

We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is deﬁned in a 2-stage setting over a ﬁrst-stage complete weighted graph having it...

Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...

claim paper

Read More »

22

click to vote

ICALP
2001
Springer

98views Programming Languages» more ICALP 2001»

Routing in Trees

14 years 5 days ago

Download www.cs.tufts.edu

Given an undirected graph with positive edge weights, deﬁne Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...

Pierre Fraigniaud, Cyril Gavoille

claim paper

Read More »

20

click to vote

SDM
2008
SIAM

197views Data Mining» more SDM 2008»

A general framework for estimating similarity of datasets and decision trees: exploring semantic similarity of decision trees

13 years 9 months ago

Download cui.unige.ch

Decision trees are among the most popular pattern types in data mining due to their intuitive representation. However, little attention has been given on the definition of measure...

Irene Ntoutsi, Alexandros Kalousis, Yannis Theodor...

claim paper

Read More »

23

click to vote

ICPR
2010
IEEE

209views Computer Vision» more ICPR 2010»

Text Separation from Mixed Documents Using a Tree-Structured Classifier

13 years 5 months ago

Download www.visionopen.com

In this paper, we propose a tree-structured multiclass classifier to identify annotations and overlapping text from machine printed documents. Each node of the tree-structured cla...

Xujun Peng, Srirangaraj Setlur, Venu Govindaraju, ...

claim paper

Read More »

19

click to vote

TKDE
2002

94views more TKDE 2002»

An Instance-Weighting Method to Induce Cost-Sensitive Trees

13 years 7 months ago