Sciweavers

48 search results - page 6 / 10
» dt 2008
Sort
View
COLT
2008
Springer
13 years 9 months ago
Learning Mixtures of Product Distributions Using Correlations and Independence
We study the problem of learning mixtures of distributions, a natural formalization of clustering. A mixture of distributions is a collection of distributions D = {D1, . . . DT },...
Kamalika Chaudhuri, Satish Rao
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
TMI
2008
92views more  TMI 2008»
13 years 7 months ago
Using Perturbation Theory to Compute the Morphological Similarity of Diffusion Tensors
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...
Ravi Bansal, Lawrence H. Staib, Dongrong Xu, Andre...
VTC
2008
IEEE
104views Communications» more  VTC 2008»
14 years 1 months ago
Low Complexity Acquisition of UWB Telemetry Data Packets with Clock Offset
—In this paper, low complexity acquisition of UWB telemetry data packets is addressed. In addition to the usual channel impairments considered of additive white Gaussian noise (A...
Saeed Khalesehosseini, John Nielsen
COR
2004
115views more  COR 2004»
13 years 7 months ago
Evaluation of decision trees: a multi-criteria approach
Data mining (DM) techniques are being increasingly used in many modern organizations to retrieve valuable knowledge structures from organizational databases, including data wareho...
Kweku-Muata Osei-Bryson