16257 search results - page 3251 / 3252 » D-finiteness: algorithms and applications |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
MOBICOM
2004
ACM
14 years 27 days ago
2004
ACM
We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-...
PPSN
1990
Springer
13 years 11 months ago
1990
Springer
T h e ease of learning concepts f r o m examples in empirical machine learning depends on the attributes used for describing the training d a t a . We show t h a t decision-tree b...
CBMS
2004
IEEE
13 years 11 months ago
2004
IEEE
Page >> Table of Contents >> Abstract 17th IEEE Symposium on Computer-Based Medical Systems (CBMS'04) p. 420 Online Medical Teaching Case Database Susan Kansagra, ...