Sciweavers

720 search results - page 10 / 144
» Linear k-arboricities on trees
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas
SIAMDM
2002
85views more  SIAMDM 2002»
13 years 8 months ago
Finding a 2-Core of a Tree in Linear Time
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
Biing-Feng Wang
FLAIRS
2001
13 years 10 months ago
Decision Tree Rule Reduction Using Linear Classifiers in Multilayer Perceptron
It hasbeenshownthat a neuralnetworkis better thana direct applicationof inductiontrees in modelingcomplex relations of inputattributes in sampledata. We proposethat conciserules b...
DaeEun Kim, Sea Woo Kim
PLDI
1994
ACM
14 years 20 days ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali
DAM
2000
89views more  DAM 2000»
13 years 8 months ago
Linear k-arboricities on trees
For a
Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-...