1923 search results - page 137 / 385 » Weighted Decision Trees |
163
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper we introduce a novel line detection algorithm based on a weighted minimum mean square error (MSE) formulation. This algorithm has been developed to enable an autonom...
157
click to vote
DAM
2010
15 years 3 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
252
click to vote
EJC
2011
14 years 9 months ago
2011
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
169
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
116
click to vote
DAM
2006
15 years 6 months ago
2006
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...