Sciweavers

154 search results - page 15 / 31
» Near Best Tree Approximation
Sort
View
IGARSS
2009
13 years 5 months ago
Within- and Between-class Variability of Spectrally Similar Tree Species
In this paper, a comparison is made through evaluating the withinand between-class species variability for the original, the first derivative and second derivative spectra. For ea...
Pravesh Debba, Moses Azong Cho, Renaud Mathieu
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
13 years 9 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin
3DIM
2007
IEEE
14 years 1 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
13 years 9 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
DIS
2008
Springer
13 years 8 months ago
Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees
We consider learning tasks where multiple target variables need to be predicted. Two approaches have been used in this setting: (a) build a separate single-target model for each ta...
Beau Piccart, Jan Struyf, Hendrik Blockeel