6110 search results - page 368 / 1222 » Approximate Computing |
139
click to vote
KDD
1998
ACM
15 years 11 months ago
1998
ACM
Wedescribe an industrial-strength data mining application in telecommunications.Theapplication requires building a short (7 byte) profile for all telephonenumbersseen on a large t...
184
click to vote
NIPS
1998
15 years 8 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
144
click to vote
DLOG
2009
15 years 7 months ago
2009
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
171
click to vote
TCS
2008
15 years 6 months ago
2008
This paper studies shapes (curves and surfaces) which can be described by (piecewise) polynomial support functions. The class of these shapes is closed under convolutions, offsett...
166
click to vote
JMIV
2002
15 years 6 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...