Sciweavers

2600 search results - page 227 / 520
» Clustering with or without the Approximation
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
Rapid Spline-based Kernel Density Estimation for Bayesian Networks
The likelihood for patterns of continuous attributes for the naive Bayesian classifier (NBC) may be approximated by kernel density estimation (KDE), letting every pattern influenc...
Boaz Lerner, Yaniv Gurwicz
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 6 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
SIGIR
2009
ACM
16 years 1 months ago
Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
Jimmy J. Lin
ICMCS
2008
IEEE
159views Multimedia» more  ICMCS 2008»
16 years 1 months ago
Using graphics devices in reverse: GPU-based Image Processing and Computer Vision
Graphics and vision are approximate inverses of each other: ordinarily Graphics Processing Units (GPUs) are used to convert “numbers into pictures” (i.e. computer graphics). I...
James Fung, Steve Mann
VTC
2006
IEEE
141views Communications» more  VTC 2006»
16 years 18 days ago
Closed-Form BER Analysis for Antenna Selection Using Orthogonal Space-Time Block Codes
— Despite significant research efforts, closed-form bit error rate (BER) expressions for multiple-input multiple-output (MIMO) systems employing transmit antenna selection and o...
Saeed Kaviani, Chintha Tellambura