16257 search results - page 3251 / 3252 » D-finiteness: algorithms and applications |
178
click to vote
KDD
2009
ACM
16 years 6 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...
179
click to vote
FCT
2009
Springer
16 years 18 days 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...
205
click to vote
MOBICOM
2004
ACM
15 years 11 months 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-...
177
click to vote
PPSN
1990
Springer
15 years 10 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...
186
click to vote
CBMS
2004
IEEE
15 years 9 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, ...