153 search results - page 10 / 31 » Uniformity Testing Using Minimal Spanning Tree |
101
click to vote
ICANNGA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
122
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper we propose a robust visual tracking method
by casting tracking as a sparse approximation problem in a
particle filter framework. In this framework, occlusion, corru...
100
click to vote
STOC
2003
ACM
15 years 12 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
125
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
153
click to vote
TMC
2012
13 years 2 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...